LeetCode1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit——单调队列

一、题目

Given an array of integers nums and an integer limit, return the size of the longest non-empty subarray such that the absolute difference between any two elements of this subarray is less than or equal to limit.

Example 1:

Input: nums = [8,2,4,7], limit = 4
Output: 2
Explanation: All subarrays are:
[8] with maximum absolute diff |8-8| = 0 <= 4.
[8,2] with maximum absolute diff |8-2| = 6 > 4.
[8,2,4] with maximum absolute diff |8-2| = 6 > 4.
[8,2,4,7] with maximum absolute diff |8-2| = 6 > 4.
[2] with maximum absolute diff |2-2| = 0 <= 4.
[2,4] with maximum absolute diff |2-4| = 2 <= 4.
[2,4,7] with maximum absolute diff |2-7| = 5 > 4.
[4] with maximum absolute diff |4-4| = 0 <= 4.
[4,7] with maximum absolute diff |4-7| = 3 <= 4.
[7] with maximum absolute diff |7-7| = 0 <= 4.
Therefore, the size of the longest subarray is 2.
Example 2:

Input: nums = [10,1,2,4,7,2], limit = 5
Output: 4
Explanation: The subarray [2,4,7,2] is the longest since the maximum absolute diff is |2-7| = 5 <= 5.
Example 3:

Input: nums = [4,2,2,2,4,4,2,2], limit = 0
Output: 3

Constraints:

1 <= nums.length <= 105
1 <= nums[i] <= 109
0 <= limit <= 109

二、题解

class Solution {
public:
    deque<int> qMax,qMin;
    int longestSubarray(vector<int>& nums, int limit) {
        int n = nums.size();
        int res = 0;
        for(int l = 0,r = 0;l < n;l++){
            while(r < n && ok(nums,nums[r],limit)){
                while(!qMax.empty() && nums[qMax.back()] <= nums[r]) qMax.pop_back();
                while(!qMin.empty() && nums[qMin.back()] >= nums[r]) qMin.pop_back();
                qMax.push_back(r);
                qMin.push_back(r);
                r++;
            }
            res = max(res,r - l);
            while(!qMax.empty() && qMax.front() <= l) qMax.pop_front();
            while(!qMin.empty() && qMin.front() <= l) qMin.pop_front();
        }
        return res;
    }
    bool ok(vector<int>& nums,int x,int limit){
        if(qMax.empty() && qMin.empty()) return true;
        int maxV = max(nums[qMax.front()],x);
        int minV = min(nums[qMin.front()],x);
        return maxV - minV <= limit;
    }
};