暴力解决
public int alternatingSubarray(int[] nums) {
//默认没找到
int res = -1;
//遍历,从每一个开始
for (int i = 0; i < nums.length; i++) {
//左边的元素
int left = nums[i];
//默认left后面没有元素
int len = 0;
//先加后减
boolean add = true;
//遍历i后面的元素
for (int j = i + 1; j < nums.length; j++) {
//右侧元素
int right = nums[j];
if (add) {
//判断是否满足+1
if (right - left == 1) {
//记录长度
len++;
//将右侧元素赋予左侧
left = right;
//下一次就是-1
add = false;
} else {
//不满足直接跳出循环
break;
}
} else {
//判断是否满足-1
if (right - left == -1) {
len++;
left = right;
add = true;
} else {
break;
}
}
}
//加过长度,取最大值
if (len != 0) {
res = Math.max(res, len + 1);
}
}
return res;
}