978. 最长湍流子数组
分类:滑动窗口
不喜欢这种题
class Solution {
public:
int maxTurbulenceSize(vector<int>& arr) {
int left = -1;
int i=0, j=1, ans=1;
for(; j<arr.size(); j++){
if(arr[j-1] < arr[j]){
if(left == 1) {
ans = max(ans, j-i);
i = j-1;
}
left = 1;
}else if(arr[j-1] > arr[j]){
if(left == 0){
ans = max(ans, j-i);
i = j-1;
}
left = 0;
}else{
ans = max(ans, j-i);
i = j;
left = -1;
}
}
return max(ans, j-i);
}
};/* 86.9% **/
2021/02/08