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?

解题思路：

这是DP的一道题。里面用到了贪心算法。如Input : [1,17,5,10,13,15,10,5,16,8]， 在序列当遍历到第一个10时，后面13，,15都是升序，为了得到最长的序列，在这个升序过程中最好选择的数字是最大的15，由于每次只遍历一次，时间复杂度为O(n), 空间复杂度为O(1), 这次运用了flag来对遍历的数字大于小于进行选择。

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