rustgym 0.2.0

rustgym solutions
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

struct Solution;

impl Solution {
    fn can_place_flowers(mut flowerbed: Vec<i32>, n: i32) -> bool {
        let m = flowerbed.len();
        let mut sum = 0;
        for i in 0..m {
            if flowerbed[i] == 0 {
                if i == 0 {
                    sum += 1;
                    flowerbed[i] = 1;
                } else {
                    if flowerbed[i - 1] == 0 {
                        sum += 1;
                        flowerbed[i] = 1;
                    }
                }
            } else {
                if i > 0 && flowerbed[i - 1] == 1 {
                    sum -= 1;
                }
            }
        }
        sum >= n
    }
}

#[test]
fn test() {
    let flowerbed: Vec<i32> = vec![1, 0, 0, 0, 1];
    assert_eq!(Solution::can_place_flowers(flowerbed, 1), true);
    let flowerbed: Vec<i32> = vec![1, 0, 0, 0, 1];
    assert_eq!(Solution::can_place_flowers(flowerbed, 2), false);
}