376. 摆动序列

376. 摆动序列

贪心算法，记录峰和谷的个数，峰+谷+1就是总的序列长度。

class Solution {
    public int wiggleMaxLength(int[] nums) {
        int up = 1,down = 1;
        int pre = 0;
        int cur = 0;
        for(int i = 1; i < nums.length;i++){
            cur = nums[i] - nums[i - 1];
            if(cur > 0 && pre <= 0){
                up = down + 1;
                pre = cur;
            }else if ( pre >= 0 && cur < 0){
                down = up + 1;
                pre = cur;
            }
        }
        return Math.max(up,down);
    }
}

class Solution {
    public int wiggleMaxLength(int[] nums) {
        int res = 1;
        int pre = 0;
        int cur = 0;
        for(int i = 1; i < nums.length;i++){
            cur = nums[i] - nums[i - 1];
            if((cur > 0 && pre <= 0) ||(pre >= 0 && cur < 0)){
                res++;
                pre = cur;
            }
        }
        return res;
    }
}