376. 摆动序列 

 1 class Solution 
 2 {
 3 public:
 4     int wiggleMaxLength(vector<int>& nums) 
 5     {
 6         //删除相邻且相同的元素
 7         nums.erase(unique(nums.begin(),nums.end()),nums.end());
 8         if(nums.size() <= 2) return nums.size();
 9         int res = 2;
10         for(int i = 1;i < nums.size() - 1;i ++)
11         {
12             int a = nums[i - 1],b = nums[i],c = nums[i + 1];
13             if(a < b && b > c) res ++;
14             else if(a > b && b < c) res ++;
15         }
16         return res;
17     }
18 };

 

posted @ 2020-04-18 16:03  Jinxiaobo0509  阅读(94)  评论(0)    收藏  举报