class Solution:
def maxSlidingWindow(self, nums: List[int], k: int) -> List[int]:
if not nums:
return []
iterate = len(nums)-k+1
m = max(nums[:k])
ans = [m]
for i in range(1, iterate):
if nums[k+i-1] > m:
m = nums[k+i-1]
elif m == nums[i-1]:
m = max(nums[i:i+k])
ans.append(m)
return ans
func arrMax(arr []int) int {
m := arr[0]
for _, v := range arr {
if v > m {
m = v
}
}
return m
}
func maxSlidingWindow(nums []int, k int) []int {
if len(nums) == 0 {
return []int{}
}
iterate := len(nums) - k + 1
max := arrMax(nums[:k])
ans := []int{max}
for i := 1; i < iterate; i++ {
if nums[k+i-1] > max {
max = nums[k+i-1]
} else if max == nums[i-1] {
max = arrMax(nums[i : i+k])
}
ans = append(ans, max)
}
return ans
}
var maxSlidingWindow = function(nums, k) {
if (nums.length == 0) {
return []
}
const iterate = nums.length - k + 1
let max = Math.max(...nums.slice(0, k))
let ans = [max]
for (let i = 1; i < iterate; i++) {
if (nums[k + i - 1] > max) {
max = nums[k + i - 1]
} else if (max === nums[i - 1]) {
max = Math.max(...nums.slice(i, i + k))
}
ans.push(max)
}
return ans
};
class Solution:
def maxSlidingWindow(self, nums: List[int], k: int) -> List[int]:
n = len(nums)
if n * k == 0:
return []
return [max(nums[i:i+k]) for i in range(n-k+1)]
class Solution:
def maxSlidingWindow(self, nums: List[int], k: int) -> List[int]:
from collections import deque
if len(nums) == 0 or k == 0:
return []
if k == 1:
return nums
n = len(nums)
def clean_deque(i):
if deq and deq[0] == i-k:
deq.popleft()
while deq and nums[i] > nums[deq[-1]]:
deq.pop()
deq = deque()
max_idx = 0
for i in range(k):
clean_deque(i)
deq.append(i)
if nums[i] > nums[max_idx]:
max_idx = i
output = [nums[max_idx]]
for i in range(k, n):
clean_deque(i)
deq.append(i)
output.append(nums[deq[0]])
return output
class Solution:
def maxSlidingWindow(self, nums: List[int], k: int) -> List[int]:
from collections import deque
d = deque()
out = []
for i, n in enumerate(nums):
while d and nums[d[-1]] < n:
d.pop()
d += [i]
if d[0] == i-k:
d.popleft()
if i >= k-1:
out += [nums[d[0]]]
return out
class Solution:
def maxSlidingWindow(self, nums: List[int], k: int) -> List[int]:
if len(nums) == 0 or k == 0:
return []
if k == 1:
return nums
n = len(nums)
left = nums.copy()
right = nums.copy()
for i in range(1, n):
if i % k != 0:
left[i] = max(left[i-1], nums[i])
j = n-i-1
if (j+1) % k != 0:
right[j] = max(right[j+1], nums[j])
out = []
for i in range(n-k+1):
out.append(max(left[i+k-1], right[i]))
return out