239. Sliding Window Maximum
Posted wentiliangkaihua
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了239. Sliding Window Maximum相关的知识,希望对你有一定的参考价值。
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. Return the max sliding window.
Example:
Input: nums =[1,3,-1,-3,5,3,6,7]
, and k = 3 Output:[3,3,5,5,6,7] Explanation:
Window position Max --------------- ----- [1 3 -1] -3 5 3 6 7 3 1 [3 -1 -3] 5 3 6 7 3 1 3 [-1 -3 5] 3 6 7 5 1 3 -1 [-3 5 3] 6 7 5 1 3 -1 -3 [5 3 6] 7 6 1 3 -1 -3 5 [3 6 7] 7
Note:
You may assume k is always valid, 1 ≤ k ≤ input array‘s size for non-empty array.
Follow up:
Could you solve it in linear time?
class Solution { public int[] maxSlidingWindow(int[] nums, int k) { if(nums.length == 0) return new int[]{}; int[] res = new int[nums.length - k + 1]; for(int i = 0; i < nums.length - k + 1; i++){ int tmp = Integer.MIN_VALUE; for(int j = i; j < i+k; j++){ tmp = Math.max(tmp, nums[j]); } res[i] = tmp; } return res; } }
以上是关于239. Sliding Window Maximum的主要内容,如果未能解决你的问题,请参考以下文章