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.

示例:

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

问题分析：

根据题意分析，我们观察到如下规律：

对于数组[1,17,5,10,13,15,10,5,16,8]来说，相邻元素的差值的符号为[1,-1,1,1,1,-1,-1,1,-1]，将每一组相邻的同符号的数只保留一个，0直接排除，可得到处理后的结果为[1,-1,1,-1,1,-1]共六个数，那么答案就是6+1 = 7 喽，具体的不试验了，大家感兴趣可以自己去尝试。

过程详见代码：

class Solution {
public:
    int wiggleMaxLength(vector<int>& nums) {
        int n = nums.size();
		if (n < 2) return n;
		vector<int> diff;
		for (int i = 1; i < nums.size(); i++)
		{
			int t = 0;
			if (nums[i] > nums[i - 1]) t = 1;
			else if (nums[i] < nums[i - 1]) t = -1;
			if (diff.empty())
			{
				if (t) diff.emplace_back(t);
			}
			else
			{
				if (t && t != diff.back()) diff.emplace_back(t);
			}
		}
		return diff.size() + 1;
    }
};