no-adjacent 0.1.1

Max sum when no two elements are adjacent in a list.
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
29
30
31
32
33
34
35

/// # Examples 
/// ```
/// use no_adjacent::interface::calculate;
///
/// fn main() {
///     let list = [2, 1, 4, 6, 8, 9, 18];
/// 
///     let sum = calculate(&list);
/// 
///     println!("sum {}", sum); // 32
/// }
/// ```
pub fn calculate(list: &[i32]) -> i32 {
    let mut max_excl = list[0];
    let mut max_incl = list[1];
    let mut next_max_incl: i32;

    let len: usize = list.len();

    for i in 2..len {
        next_max_incl = list[i] + max_excl;

        if max_incl > max_excl {
            max_excl = max_incl;
        }

        max_incl = next_max_incl;
    }

    if max_incl > max_excl {
        return max_incl;
    }

    return max_excl;
}