leetcode 1438.绝对差不超过限制的最长连续子数组
题干
给你一个整数数组 nums ,和一个表示限制的整数 limit,请你返回最长连续子数组的长度,该子数组中的任意两个元素之间的绝对差必须小于或者等于 limit 。
如果不存在满足条件的子数组,则返回 0 。
示例 1:
输入:nums = [8,2,4,7], limit = 4
输出:2
解释:所有子数组如下:
[8] 最大绝对差 |8-8| = 0 <= 4.
[8,2] 最大绝对差 |8-2| = 6 > 4.
[8,2,4] 最大绝对差 |8-2| = 6 > 4.
[8,2,4,7] 最大绝对差 |8-2| = 6 > 4.
[2] 最大绝对差 |2-2| = 0 <= 4.
[2,4] 最大绝对差 |2-4| = 2 <= 4.
[2,4,7] 最大绝对差 |2-7| = 5 > 4.
[4] 最大绝对差 |4-4| = 0 <= 4.
[4,7] 最大绝对差 |4-7| = 3 <= 4.
[7] 最大绝对差 |7-7| = 0 <= 4.
因此,满足题意的最长子数组的长度为 2 。
示例 2:
输入:nums = [10,1,2,4,7,2], limit = 5
输出:4
解释:满足题意的最长子数组是 [2,4,7,2],其最大绝对差 |2-7| = 5 <= 5 。
示例 3:
输入:nums = [4,2,2,2,4,4,2,2], limit = 0
输出:3
提示:
1 <= nums.length <= 10^5
1 <= nums[i] <= 10^9
0 <= limit <= 10^9
题解
并不是很好的解法,利用c++扩展库的红黑树储存{数值,下标}并获得滑动窗口内的最值
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
class Solution {
public:
int longestSubarray(vector<int>& nums, int limit) {
int n = nums.size();
int ans = 0;
int leftBound = 0,rightBound = 0;
int maxNum = 0,minNum = 0x3f3f3f3f;
tree<std::pair<int, int>,null_type,std::less<std::pair<int, int>>,rb_tree_tag,tree_order_statistics_node_update> window;
while(rightBound < n){
window.insert({nums[rightBound],rightBound});
while((*window.find_by_order(rightBound - leftBound)).first - (*window.find_by_order(0)).first > limit && leftBound <= rightBound){
window.erase({nums[leftBound],leftBound});
leftBound++;
}
ans = max(ans,rightBound - leftBound + 1);
rightBound++;
}
return ans;
}
};
毕竟只要求最大和最小元素,所以利用multiset有序的特性,用multiset来维护窗口,并用begin和rbegin迭代器来获得最值即可
class Solution {
public:
int longestSubarray(vector<int>& nums, int limit) {
int n = nums.size();
int leftBound = 0, rightBound = 0;
int ans = 0;
multiset<int> window;
while (rightBound < n) {
window.insert(nums[rightBound]);
while (*window.rbegin() - *window.begin() > limit) {
window.erase(window.find(nums[leftBound]));
leftBound++;
}
ans = max(ans, rightBound - leftBound + 1);
rightBound++;
}
return ans;
}
};