贪心算法 | LeetCode 376. 摆动序列

找出局部峰值即可

    public int wiggleMaxLength(int[] nums) {
        if (nums.length <= 1) {
            return nums.length;
        }
        int result = 1, front = 0, behind = 0;
        for (int i = 0; i < nums.length - 1; i++) {
            front = nums[i] - nums[i + 1];
            if ((front > 0 && behind < 0) || (front < 0 && behind >= 0)){
                behind = front;
                result++;
            }
        }
        return result;
    }