[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?

我的思路：
开始假设Wiggle Subsequence的len = 数组的长度。
遍历一遍数组，记录两个相邻数之间的差，并且存储不为0的差到wiggle数组中，若为0则Wiggle Subsequence的长度len减1
然后从头再次遍历一遍wiggle数组如果相邻的两个数相乘>0则wiggle Subsequence的长度减1
最终得到的结果是Wiggle Subsequence的长度。

时间复杂度为O(n),空间复杂度为O(n);

具体代码实现：

public class Solution {
    public int wiggleMaxLength(int[] nums) {
        int len = nums.length;
        if(len <= 1){
            return len;
        }

        int[] wiggle = new int[len-1];
        int wiggle_len = len ;
        int j = 0;
        for(int i = 1; i < len; i++){
            int num = nums[i] - nums[i - 1];
            if(num != 0){
                wiggle[j] = num;
                j++;
            }
            if(num == 0){
                wiggle_len--;
            }
        }

        for(int k = 0; k < j-1 ; k++){
            if(wiggle[k] * wiggle[k+1] > 0 ){
                wiggle_len--;
            }
        }

        return wiggle_len;
    }
}