class Solution {
public:
int wiggleMaxLength(vector<int>& nums) {
nums.erase(unique(nums.begin(),nums.end()),nums.end());
if(nums.size()<=2)return nums.size();
int count=2;
for(int i=1;i+1<nums.size();i++)
{
int a=nums[i-1],b=nums[i],c=nums[i+1];
if(a<b&&b>c)count++;
else if(a>b&&b<c)count++;
}
return count;
}
};
leetcode 376. 摆动序列(Cpp语法)
最新推荐文章于 2021-05-28 11:11:03 发布