Beautiful Arrangement II LeetCode solution in Rust

1
impl Solution {
2
  pub fn construct_array(n: i32, k: i32) -> Vec<i32> {
3
    let mut k = k;
4
    let mut result = Vec::with_capacity(n as usize);
5
    let mut i = 1;
6
    let mut j = n;
7
    while i <= j {
8
      if k % 2 == 1 {
9
        result.push(i);
10
        i += 1;
11
      } else {
12
        result.push(j);
13
        j -= 1;
14
      }
15
      if k > 1 {
16
        k -= 1;
17
      }
18
    }
19
    result
20
  }
21
}