1、最长湍流子数组
public int maxTurbulenceSize(int[] arr) {
int len=arr.length;
if (len==1||(len==2&&arr[0]==arr[1])) return 1;
if (len==2) return 2;
int res=1;
int left=0,right=1;
boolean pre=false;
while (right<len){
boolean cur=arr[right-1]<arr[right];
if (right==1||cur==pre){
left=right-1;
}
if (arr[right-1]==arr[right]){
left=right;
}
right++;
res=Math.max(res,right-left);
pre=cur;
}
return res;
}