376. 摆动序列

`class Solution {
public int wiggleMaxLength(int[] nums) {
boolean up = true;
boolean begin = true;
// flag为真表示递增
if (nums.length == 1)
return 1;
int counts = 1;
for (int i = 1; i < nums.length; i++) {

        if (!begin) {
            if (up) {
                if (nums[i] > nums[i - 1]) {
                    continue;
                } else if (nums[i] < nums[i - 1]) {

                    up = false;
                    counts++;
                }
            } else {
                 if (nums[i] < nums[i - 1]) {
                    continue;
                } else if (nums[i] > nums[i - 1]) {

                    up = true;
                    counts++;
                }

            }
        }

        if (begin) {
            if (nums[i] > nums[i - 1]) {
                up = true;
                counts++;
            } else if (nums[i] < nums[i - 1]) {

                up = false;
                counts++;
            } else {
                continue;
            }
            begin = false;
        }

    }
    return counts;
}

}`