Maximum Alternating Subsequence Sum LeetCode solution in Rust

1
impl Solution {
2
  pub fn max_alternating_sum(nums: Vec<i32>) -> i64 {
3
    let n = nums.len();
4
    let nums = nums.into_iter().map(|v| v as i64).collect::<Vec<i64>>();
5
    let mut a = nums[0];
6
    let mut b = 0;
7

8
    for i in 1..n {
9
      let v = nums[i];
10
      b = b.max(a - v);
11
      a = a.max(b + v);
12
    }
13

14
    a.max(b)
15
  }
16
}