# -*- coding:utf-8 -*-

class Solution:

    def maxInWindows(self, num, size):

        # write code here

        if len(num) < size or size == 0:

            return []

        # 思路1

        # left, right = 0, size-1

        # res = []

        # while right < len(num):

        #     maxindex = left

        #     for j in range(left+1,right+1):

        #         if num[j] > num[maxindex]:

        #             maxindex = j

        #     res.append(num[maxindex])

        #     left += 1

        #     right += 1

        # return res

        # 思路2

        res = []

        for i in range(len(num)-size+1):

            res.append(max(num[i:i+size]))

        return res

if __name__ == '__main__':

    result = Solution().maxInWindows([2,3,4,2,6,2,5,1],3)

    print(result)