LeetCode 376. Wiggle Subsequence 摇摆序列

Question:

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?

原问题链接：https://leetcode.com/problems/wiggle-subsequence/description/

思路：

贪心算法，状态机。若为上升状态尽可能选择大的数，以保证下一次为下降状态的概率更大，反之亦然。这样就是选择最后一个上升状态或者最后一个下降状态的数。状态机解法，在每次状态改变时,length++; 参考小象学院LeetCode刷题班思路。

class Solution {
    public int wiggleMaxLength(int[] nums) {
        if(nums.length < 2 )
            return nums.length;
        final int begin = 0;
        final int up = 1;
        final int down = 2;
        int state = begin;
        int wigmaxlen = 1;
        
        for (int i = 1; i <nums.length; i++ )
        {
        switch(state)
        {
            case begin:
                if(nums[i]<nums[i-1])
                {
                    state = down;
                    wigmaxlen++;
                }
                else if(nums[i]>nums[i-1])
                {
                    state = up;
                    wigmaxlen++;
                }
                break;
            case down:
                if(nums[i]>nums[i-1])
                {                 //判断后的大括号要记得，不然每次进入一个数wigmaxlen都+1。
                    state = up;
                    wigmaxlen++;
                }
                break;
            case up:
                if(nums[i]<nums[i-1])
                {
                    state = down;
                    wigmaxlen++;
                }
                break;
        }
        }
        return wigmaxlen;
    }
}

博主学习笔记，转载请注明出处，谢谢~