力扣2765-最长交替子数组

最长交替子数组

题目链接

class Solution {
public:
    int alternatingSubarray(vector<int>& nums) {
        int res = -1;
        int n = nums.size();
        for (int firstIndex = 0; firstIndex < n; firstIndex++) {//外层循环，子数组的第一个下标
            for (int i = firstIndex + 1; i < n; i++) {//内层循环，查找满足要求的子数组
                int length = i - firstIndex + 1;//满足要求子数组的长度
                if (nums[i] - nums[firstIndex] == (length - 1) % 2) {//算法，满足这个条件的为满足要求的子数组
                    res = max(res, length);//取最大值
                } else {
                    break;
                }
            }
        }
        return res;
    }
};