题目:
给定一个数组和滑动窗口的大小,找出所有滑动窗口里数值的最大值。例如,如果输入数组{2,3,4,2,6,2,5,1}及滑动窗口的大小3,那么一共存在6个滑动窗口,他们的最大值分别为{4,4,6,6,6,5}; 针对数组{2,3,4,2,6,2,5,1}的滑动窗口有以下6个: {[2,3,4],2,6,2,5,1}, {2,[3,4,2],6,2,5,1}, {2,3,[4,2,6],2,5,1}, {2,3,4,[2,6,2],5,1}, {2,3,4,2,[6,2,5],1}, {2,3,4,2,6,[2,5,1]}。
思路一:
记录最大值下标
代码:
class Solution:
def maxInWindows(self, num, size):
if not size: return []
arr = []
maxindex = num.index(max(num[:size]))
for i in range(len(num)-size+1):
if maxindex >= i:
if num[i+size-1] >= num[maxindex]: maxindex = i+size-1
else: maxindex = num.index(max(num[i:i+size]))
arr.append(num[maxindex])
return arr
思路二:
双向队列
代码:
class Solution:
def maxInWindows(self, num, size):
if not size: return []
queue, arr = [], []
for i in range(len(num)):
if queue and queue[0] < i-size+1:
queue.pop(0)
while queue and num[queue[-1]] < num[i]:
queue.pop()
queue.append(i)
if i-size+1 >= 0:
arr.append(num[queue[0]])
return arr