leetcode——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

解析：如果一段连续子序列为递增或者递减，显然有且仅且只能取1个数字加入到最长摆动序列中，因此最长摆动序列元素数目即等于序列中波峰波谷的数目，所以只要计算其递增以及递减序列的数目。具体代码如下，算法时间复杂度为O(n)，空间复杂度为O(1).

class Solution {
public:
	int wiggleMaxLength(vector<int>& nums) {
		if(nums.size() < 2)	return nums.size();
		bool Ascending = true;
		int num = 1, n = nums.size(), i;
		for(i=1; i<n; i++)
			if(nums[i] != nums[i-1])
			{
				if(nums[i++] < nums[0])	Ascending = false;
				num = 2;
				break;
			}
		for(; i<n; i++)
			if(nums[i] < nums[i-1] && Ascending || nums[i] > nums[i-1] && !Ascending)
			{
				Ascending = !Ascending;
				num ++;
			}
		return num;
	}
};