题目描述
给定一个数组和滑动窗口的大小,找出所有滑动窗口里数值的最大值。例如,如果输入数组{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]}。
思路:注意滑动窗口为0时,返回空列表
# -*- coding:utf-8 -*-
class Solution:
def maxInWindows(self, num, size):
# write code here
res = []
if not size: # 如果size=0,返回空列表
return res
for i in range(len(num)):
if i+size <= len(num):
res.append(self.MaxNum(num[i:i+size]))
return res
def MaxNum(self, num):
biggest = num[0]
for i in range(1, len(num)):
biggest = max(biggest, num[i])
return biggest