leetcode

0 class Solution {

1 public:

2 int wiggleMaxLength(vector<int> &nums) {

3 if (nums.size() == 0) return 0;

4 int up = 1, down = 1;

5 for (int i = 1; i < nums.size(); i++) {

6 if (nums[i] < nums[i - 1])

7 down = up + 1;

8 else if (nums[i] > nums[i - 1])

9 up = down + 1;

10 }

11 return max(up, down);

12 }

13 };