class Solution:
    def maxInWindows(self , nums: List[int], k: int) -> List[int]:
        # write code here
        if not nums or k==0: return []
        if k==1: return nums
        ans=[]
        mark=0
        while mark+k<=len(nums):
            res=0
            for i in range(k):
                if nums[mark+i]>res:
                    res=nums[mark+i]
            ans.append(res)
            mark+=1
        return ans