问题描述
给你一个整数数组 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
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
思路分析及代码实现
一开始用的滑动窗口的常规思路,时间复杂度为O(N^2),很明显超时了,因为他把所有的子串都遍历了一遍
class Solution:
def longestSubarray(self, nums: List[int], limit: int) -> int:
n = len(nums)
left = 0
right = 1
res = 0
minx = 0
maxx = 0
seen = {}
ans = 0
while right <= n:
window = nums[left:right]
minx = min(window)
maxx = max(window)
res = maxx - minx
if res <= limit:
if res not in seen:
seen[res] = right - left
if right - left > seen[res]:
seen[res] = right - left
right += 1
else:
left += 1
right = left + 1
ans = max(seen.values())
return ans
然后从题解里学到一种方法,滑窗加双队列的组合
class Solution:
def longestSubarray(self, nums: List[int], limit: int) -> int:
left = 0
right = 0
res = 0
min_x = collections.deque()
max_x = collections.deque()
for num in nums:
while len(min_x) and num < min_x[-1]:
min_x.pop()
while len(max_x) and num > max_x[-1]:
max_x.pop()
min_x.append(num)
max_x.append(num)
right += 1
while max_x[0] - min_x[0] > limit:
if min_x[0] == nums[left]:
min_x.popleft()
if max_x[0] == nums[left]:
max_x.popleft()
left += 1
res = max(res, right-left)
return res