- This is a typical
- To always know the max of current window, we need to main a queue in
valuein the queue because we need to check if
maxis located in window or not.
You are given an array of integers nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the k numbers in the window. Each time the sliding window moves right by one position.
Return the max sliding window.
Input: nums = [1,3,-1,-3,5,3,6,7], k = 3