239. Sliding Window Maximum
?
Question Editorial Solution
My Submissions
?Total Accepted: 34731
?Total Submissions: 117980
?Difficulty: Hard
Given an array 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.
For example,
Given nums = [1,3,-1,-3,5,3,6,7], and k = 3.
Window position
Max
---------------
-----
[13-1] -35367 3
1 [3-1-3] 5367 3
13 [-1-35] 367 5
13-1 [-353] 67 5
13-1-3 [536] 7 6
13-1-35 [367]7
Therefore, return the max sliding window as [3,3,5,5,6,7].
Note:
You may assume k is always valid, ie: 1 ≤ k ≤ input array's size for non-empty array.
|
