Steward

分享是一種喜悅、更是一種幸福

程式語言 - LeetCode - C++ - 376. Wiggle Subsequence

---

題目：


解答：

class Solution {
public:
    int wiggleMaxLength(vector<int>& nums) {
        int up = 1;
        int down = 1;
        int n = nums.size();

        if (n < 2) {
            return n;
        }

        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);
    }
};