1. 思路
双指针法
2. 代码
# -*- coding:utf-8 -*-
class Solution:
def maxInWindows(self, num, size):
# write code here
if size > len(num) or size == 0:return []
head_index = 0
tail_index = size-1
results = []
while tail_index < len(num):
results.append(max(num[head_index:tail_index+1]))
head_index += 1
tail_index += 1
return results