2760. 最长奇偶子数组

class Solution {
public:
    int longestAlternatingSubarray(vector<int>& nums, int threshold) {
        int ans = 0, l = -1, r = -1;
        for (int i = 0; i < nums.size(); i++) {
            if (l >= 0) {
                if (nums[i] % 2 != nums[i - 1] % 2 && nums[i] <= threshold) {
                    r = i;
                    ans = max(ans, r - l + 1);
                } else {
                    ans = max(ans, r - l + 1);
                    l = r = -1;
                }
            }
            if (l < 0 && r < 0 && nums[i] % 2 == 0 && nums[i] <= threshold) {
                l = r = i;
                ans = max(ans, r - l + 1);
            }
        }
        return ans;
    }
};