algs 0.1.2

Solutions for various algorithms, made as generic as possible
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28

#[derive(Debug)]
pub struct LinkedList {
    pub val: i32,
    pub next: Option<Box<LinkedList>>,
}

impl LinkedList {
    pub fn new(val: i32) -> LinkedList {
        LinkedList { val, next: None }
    }

    // Convenience function to convert array to LinkedList
    pub fn from_array(array: Vec<i32>) -> LinkedList {
        let mut current = LinkedList {
            val: array[0],
            next: None,
        };

        for i in array.iter().skip(1) {
            let new = LinkedList {
                val: *i,
                next: Some(Box::new(current)),
            };
            current = new;
        }
        current
    }
}