给定一个数组 nums,有一个大小为 k 的滑动窗口从数组的最左侧移动到数组的最右侧。你只可以看到在滑动窗口内的 k 个数字。滑动窗口每次只向右移动一位。
返回滑动窗口中的最大值。
进阶:
你能在线性时间复杂度内解决此题吗?
示例:
输入: nums = [1,3,-1,-3,5,3,6,7], 和 k = 3
输出: [3,3,5,5,6,7]
提示:
1 <= nums.length <= 10^5
-10^4 <= nums[i] <= 10^4
1 <= k <= nums.length
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/sliding-window-maximum
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
private Deque<Integer> deque;
private int[] nums;
private int k;
private int n;
public int[] maxSlidingWindow(int[] nums, int k) {
if (nums == null || k == 0) {
return new int[0];
}
init(nums, k);
if (n == 0) {
return new int[0];
}
int[] ans = new int[n - k + 1];
for (int i = 0; i < k; i++) {
cleanDeque(i);
deque.addLast(i);
}
ans[0] = nums[deque.getFirst()];
for (int i = k; i < n; i++) {
cleanDeque(i);
deque.addLast(i);
ans[i - k + 1] = nums[deque.getFirst()];
}
return ans;
}
private void init(int[] _nums, int _k) {
this.nums = _nums;
deque = new ArrayDeque<>();
this.k = _k;
n = _nums.length;
}
private void cleanDeque(int i) {
if (!deque.isEmpty() && deque.getFirst() == i - k) {
deque.removeFirst();
}
while (!deque.isEmpty() && nums[deque.getLast()] < nums[i]) {
deque.removeLast();
}
}
public int[] maxSlidingWindow_2(int[] nums, int k) {
if (nums == null || k == 0) {
return new int[0];
}
int n = nums.length;
if (n == 0) {
return new int[0];
}
int[] left = new int[n];
left[0] = nums[0];
int[] right = new int[n];
right[n - 1] = nums[n - 1];
for (int i = 1; i < n; ++i) {
if (i % k == 0) {
left[i] = nums[i];
} else {
left[i] = Math.max(left[i - 1], nums[i]);
}
int j = n - i - 1;
if ((j + 1) % k == 0) {
right[j] = nums[j];
} else {
right[j] = Math.max(right[j + 1], nums[j]);
}
}
int[] ans = new int[n - k + 1];
for (int i = 0; i < n - k + 1; ++i) {
ans[i] = Math.max(left[i + k - 1], right[i]);
}
return ans;
}