Wiggle Subsequence

public class WiggleSubsequence {

public int wiggleMaxLength(int[] nums) {
if(nums.length==2&&nums[0]==nums[1]){
return 1;
}
if(nums.length==2&&(nums[0]!=nums[1])){
return 2;
}
int state=3;//不确定状态 1上升 －1 下降 0 平稳

int max=0;
for(int i=1;i<nums.length;i++){
if(state==2){
if(nums[i]-nums[i-1]>0){
state=1;
max=2;
continue;
}
if(nums[i]-nums[i-1]<0){
state = -1;
max=2;
continue;
}
else {
state=0;
max=1;
continue;
}
}
if(state==1){
if(nums[i]<nums[i-1]){
max++;
state=-1;
continue;
}
else{
continue;
}
}
if(state == 0){//遇到前后两个相同的数
continue;
}
if(state == -1){
if(nums[i]>nums[i-1]){
max++;
state = 1;
continue;
}
else continue;
}
}
return max;
}

}