力扣(LeetCode)官网 - 全球极客挚爱的技术成长平台
class Solution {
public int alternatingSubarray(int[] nums) {
int ans = 0;
for (int i = 0; i < nums.length; i++) {
int diff = 1;// 表示差值
int len = 1;// 交替子数组的长度
for (int j = i + 1; j < nums.length; j++) {
if (nums[j] - nums[j - 1] != diff) {
break;
}
len += 1;
diff *= -1;
}
ans = Math.max(ans,len);
}
return ans = ans > 1 ? ans:-1;
}
}