leetcode/array/src/solution/s0665_non_decreasing_array.rs at main · StrayLittlePunk/leetcode · GitHub

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
36
37
38
#![allow(unused)]
pub struct Solution {}

impl Solution {
    pub fn check_possibility(mut nums: Vec<i32>) -> bool {
        let mut modify = 0;
        for i in 1..nums.len() {
            if nums[i - 1] > nums[i] {
                modify += 1;
                if i == 1 || nums[i - 2] <= nums[i] {
                    nums[i - 1] = nums[i];
                } else {
                    nums[i] = nums[i - 1];
                }
            }
        }

        modify <= 1
    }
}

#[test]
fn testcase() {
    let v = vec![4, 2, 3];
    assert_eq!(true, Solution::check_possibility(v));

    let v = vec![4, 2, 1];
    assert_eq!(false, Solution::check_possibility(v));

    let v = vec![3, 4, 2, 3];
    assert_eq!(false, Solution::check_possibility(v));

    let v = vec![1, 1, 1];
    assert_eq!(true, Solution::check_possibility(v));

    let v = vec![2, 3, 3, 2, 2];
    assert_eq!(false, Solution::check_possibility(v));
}