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 res = 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) res++; //局部最大值
if(a > b && b < c) res++; //局部最小值
}
return res;
}
};
376. Wiggle Subsequence
最新推荐文章于 2020-12-12 23:11:44 发布