数组中最长摆动子序列 Wiggle Subsequence

2019独角兽企业重金招聘Python工程师标准>>>

问题：

A sequence of numbers is called a wiggle sequence if the differences between successive numbers strictly alternate between positive and negative. The first difference (if one exists) may be either positive or negative. A sequence with fewer than two elements is trivially a wiggle sequence.

For example, [1,7,4,9,2,5] is a wiggle sequence because the differences (6,-3,5,-7,3) are alternately positive and negative. In contrast, [1,4,7,2,5] and [1,7,4,5,5] are not wiggle sequences, the first because its first two differences are positive and the second because its last difference is zero.

Given a sequence of integers, return the length of the longest subsequence that is a wiggle sequence. A subsequence is obtained by deleting some number of elements (eventually, also zero) from the original sequence, leaving the remaining elements in their original order.

Examples:

Input: [1,7,4,9,2,5]
Output: 6
The entire sequence is a wiggle sequence.
Input: [1,17,5,10,13,15,10,5,16,8]
Output: 7
There are several subsequences that achieve this length. One is [1,17,10,13,10,16,8].
Input: [1,2,3,4,5,6,7,8,9]
Output: 2

Follow up:
Can you do it in O(n) time?

解决：① 动态规划和贪心。假设返回值是maxLen。如果nums[0]<nums[1]（递增），并且nums[2]<nums[1]（递减），那么res+=1。但如果nums[2]>=nums[1]，那么保留pre=nums[2]（这里可以这么想：之后要的是递减的状态，nums[2]>=nums[1]，可以认为nums[2]比nums[1]接下来更有形成递减状态的可能，所以保留pre=nums[2]）。后面的数只要和pre（nums[2]）比较就可以了。

class Solution { //0ms
    public int wiggleMaxLength(int[] nums) {
        int len = nums.length;
        if (len < 2) return len;
        int maxLen = 1;//记录摆动序列的最大长度
        int pre = nums[0];//记录摆动序列的最后一个值
        boolean isIncrease = nums[0] < nums[1];//标识下一次期望应该向上还是向下
        int tmp = 1;
        while (tmp < nums.length && pre == nums[tmp]){//处理数组开始时相等的情况，也就是对isIncrease的初始化情况
            pre = nums[tmp];
            tmp ++;
            if(tmp < nums.length) isIncrease = pre < nums[tmp];
        }
        for (int i = tmp;i < nums.length;i ++){
            if (pre < nums[i] && isIncrease){//期望向上并且满足
                isIncrease = false;
                maxLen ++;
            }else{
                if (! isIncrease && pre > nums[i]) {//期望向下并且满足了
                    isIncrease = true;
                    maxLen++;
                }
            }
            pre = nums[i];//更新摆动序列的最后一个值
        }
        return maxLen;
    }
}

② 在disscuss中看到了超短的解法。

class Solution { //0ms
    public int wiggleMaxLength(int[] nums) {
        if (nums == null || nums.length == 0) return 0;
        int up = 1;//向上的序列的个数
        int down = 1;//向下的序列的个数
        for (int i = 1;i < nums.length;i ++){
            if (nums[i] > nums[i - 1]){
                up = down + 1;
            }else if (nums[i] < nums[i - 1]){
                down = up + 1;
            }
        }
        return Math.min(nums.length,Math.max(up,down));
    }
}

转载于:https://my.oschina.net/liyurong/blog/1596001