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.
class Solution {
public int[] maxSlidingWindow(int[] nums, int k) {
Deque<Integer> q = new ArrayDeque<>();
List<Integer> res = new ArrayList<>();
for (int i = 0; i < nums.length; i++) {
while (!q.isEmpty() && nums[q.getLast()] <= nums[i]) {
q.removeLast();
}
q.addLast(i);
if (q.getFirst() == i - k) {
q.removeFirst();
}
if (i >= k - 1) {
res.add(nums[q.peek()]);
}
}
return res.stream().mapToInt(i->i).toArray();
}
}
