[LeetCode]376. Wiggle Subsequence

Description:

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?

Credits:
Special thanks to @agave and @StefanPochmann for adding this problem and creating all test cases.

————————————————————————————————————————————————————————————————

Solution:

一开始没注意到可以删除元素，先写了个不删除的版本：

class Solution {
public:
    int wiggleMaxLength(vector<int>& nums) {
        if (nums.size() <= 0)
            return 0;
         
        // 不删除元素的情况下寻找wiggle sequence
        int maxLength = 1, curLength = 1, up = 0;
        for (int i = 1; i < nums.size(); i++) {
            if (nums[i] == nums[i - 1]) {
                maxLength = max(maxLength, curLength);
                curLength = 1;
                up = 0;
            } else if ((up == 1 && nums[i] > nums[i - 1]) || (up == -1 && nums[i] < nums[i - 1])) {
                curLength++;
                up = -up;
            } else if (up == 0) {
                curLength++;
                up = nums[i] > nums[i - 1] ? -1 : 1;
            } else {
                maxLength = max(maxLength, curLength);
                curLength = 2;
            }   
        }
        
        return max(maxLength, curLength);
    }
};

以下是题目要求的版本，思路与122. Best Time to Buy and Sell Stock II类似，可以根据峰谷算法来写：

class Solution {
public:
    int wiggleMaxLength(vector<int>& nums) {
        if (nums.size() <= 0)
            return 0;
         
        int maxLength = 1, up = 0;
        for (int i = 1; i < nums.size(); i++) {
            if (nums[i] == nums[i - 1]) {
                ;
            } else if (up == 0) {
                maxLength++;
                up = nums[i] > nums[i - 1] ? -1 : 1;
            } else if ((up == 1 && nums[i] > nums[i - 1]) || (up == -1 && nums[i] < nums[i - 1])) {
                maxLength++;
                up = -up;
            } else {
                ;
            }   
        }
        
        return maxLength;
    }
};