Leetcode 376 wiggle-subsequence 贪心

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