Repository navigation
Expand file tree
/
Copy pathLeetCode239.java
More file actions
52 lines (50 loc) · 1.5 KB
/
Copy pathLeetCode239.java
File metadata and controls
52 lines (50 loc) · 1.5 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
package heap;
import java.util.Comparator;
import java.util.Deque;
import java.util.LinkedList;
import java.util.PriorityQueue;
/**
* Description:
*
* @author elijahliu
* @Note Talk is cheap,just show me ur code.- -!
* ProjectName:EAlgorithm
* PackageName: heap
* Date: 2020/8/15 22:04
*/
public class LeetCode239 {
public int[] maxSlidingWindow(int[] nums, int k) {
if (nums == null || nums.length == 0) {
return null;
}
Deque<Integer> deque = new LinkedList<>();
int res[] = new int[nums.length - k + 1];
for (int i = 0; i < nums.length; i++) {
if (i >= k && deque.peek() <= i - k) {
deque.pollFirst();
}
while (!deque.isEmpty() && nums[deque.peekLast()] <= nums[i]) {
deque.pollLast();
}
deque.addLast(i);
if (i >= k-1) {
res[i - k + 1] = nums[deque.peek()];
}
}
return res;
}
public int[] maxSlidingWindow2(int[] nums, int k) {
PriorityQueue<Integer> priorityQueue = new PriorityQueue<>((o1, o2) -> o2 - o1);
int[] res = new int[nums.length - k + 1];
for (int i = 0; i < nums.length; i++) {
if (i < k) {
priorityQueue.offer(nums[i]);
continue;
}
priorityQueue.remove(nums[i - k + 1]);
priorityQueue.add(nums[i]);
res[i - k + 1] = priorityQueue.peek();
}
return res;
}
}