subject ：
Given an array nums, There is a size of k The sliding window of the array moves from the leftmost side to the rightmost side of the array . You can only see... In the sliding window k A digital . The sliding window moves only one bit to the right at a time .
Returns the maximum value in the sliding window .
Code ：
class Solution:
def func(self , nums,k):
res = []
lo , hi = 0 , k-1
while hi <= len(nums) -1:
curt = nums[lo:hi+1]
res.append(max(curt))
hi += 1
lo += 1
return res
a = [2,3,4,2,6,2,5,1]
k = 3
s = Solution()
print(s.func(a,k))Output ：
[4, 4, 6, 6, 6, 5]
