ARST打卡第325周

 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

impl Solution {
    pub fn count_hill_valley(nums: Vec<i32>) -> i32 {
        let mut ans: i32 = 0;
        let mut i = 0;
        let mut j = 1;
        let mut k = 2;
        while k < nums.len() {
            // 跳过与nums[i]相等的值
            while j < nums.len() && nums[j] == nums[i] {
                j += 1;
            }
            if j >= nums.len() {
                break;
            }
            
            // 跳过与nums[j]相等的值
            k = j + 1;
            while k < nums.len() && nums[k] == nums[j] {
                k += 1;
            }
            if k >= nums.len() {
                break;
            }
            
            if (nums[i] < nums[j] && nums[j] > nums[k]) || (nums[i] > nums[j] && nums[j] < nums[k]) {
                ans += 1;
            }
            
            i = j;
            j = k;
            k += 1;
        }
        ans
    }
}