1、题目
https://leetcode-cn.com/problems/wiggle-subsequence/
2、题意
题解1:贪心
class Solution {
public:
int wiggleMaxLength(vector<int>& nums) {
int n = nums.size();
if(n<2) return nums.size();
int down = 1,up = 1;
for(int i=1;i<n;i++)
{
if(nums[i]>nums[i-1])
up = down+1;
else if(nums[i]<nums[i-1])
down = up+1;
}
return max(up,down);
}
};