leetcode 376. Wiggle Subsequence

题目要求：

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?

思路：

使用动态规划方法，从数组开头以每个数为每次迭代的边界，第i次迭代的计算结果就是从数组开始到下标为i的数为止的最长的摇摆序列，需要注意的是并不需要记录序列中的数字，而且这个序列的最后一位一定是下标为i的数，因为如果nums[i-1]>nums[i-2]，并且nums[i]<nums[i-1]，那么nums[i]就是最长的摇摆序列的最后一位，如果nums[i-1]>nums[i-2]，并且nums[i]>nums[i-1]，这种情况下如果想要增长摇摆序列，那么nums[i]后面一定要有一个数x小于nums[i-1]，如果这个数x小于nums[i-1]，那么它一定小于nums[i]，所以就可以用nums[i]代替nums[i-1]作为当前最长摇摆序列的最后一位；然后nums[i-1]<nums[i-2]的情况的nums[i-1]>nums[i-2]的情况相同，就不再赘述。这种方法也不需要写递推方程了，时间复杂度可以做到O(n)

其他需要使用到的辅助变量有：一个数组isPositive，isPositive[i]为1代表nums[i]>nums[i-1]，isPositive[i]为0代表nums[i]<nums[i-1]，这个数数组主要作用就是方便判断最长摇摆序列的最后一个差值是正数还是负数，减少计算量；另外就是一个变量sum来记录最长序列的长度，需要注意的是sum的初值。

代码：

public class Solution {
    public int wiggleMaxLength(int[] nums) {
        int length = nums.length;
        if(length == 0){
            return 0;
        }
        if(length == 1){
            return 1;
        }
        int sum;
        boolean[] isPositive  = new boolean[length];
        int i;
        for(i=0;i<length-1;i++){//找到第一个有意义的差值
            if(nums[i]!=nums[i+1]){
                break;
            }
        }
        if(i == (length-1)){//所有数都相同
            return 1;
        }
        isPositive[i+1] = nums[i+1]>nums[i];
        sum = 2;
        for(i=i+2;i<length;i++){
            if(isPositive[i-1]){//取最小
                if(nums[i]<nums[i-1]){
                    sum++;
                    isPositive[i] = false;
                }
                else{
                    isPositive[i] = isPositive[i-1];
                }
            }
            else{
                if(nums[i]>nums[i-1]){
                    sum++;
                    isPositive[i] = true;
                }
                else{
                    isPositive[i] = isPositive[i-1];
                }
            }
        }
        return sum;
    }
}