-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMaxQueue.java
More file actions
71 lines (52 loc) · 1.37 KB
/
MaxQueue.java
File metadata and controls
71 lines (52 loc) · 1.37 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
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
package com.leetcode.queue;
import java.util.ArrayDeque;
import java.util.Deque;
/**
* 改进方案就是自定义个链表
*/
public class MaxQueue {
private Deque<Integer> queue;
private Deque<Integer> maxQueue;
public MaxQueue() {
queue = new ArrayDeque<>();
maxQueue = new ArrayDeque<>();
}
public int max_value() {
if(queue.isEmpty()) return -1;
return maxQueue.peekLast();
}
public void push_back(int value) {
/*if(!maxQueue.isEmpty()){
*//*耗时操作**//*
int i = 0;
int size=maxQueue.size();
while (i<size&&value<=maxQueue.get(i)){
i++;
}
for(;i<size;i++){
maxQueue.remove(i);
}
}*/
while (!maxQueue.isEmpty()&&maxQueue.peek()<value){
maxQueue.pop();
}
maxQueue.push(value);
queue.add(value);
}
public int pop_front() {
if(queue.isEmpty()) return -1;
Integer head = queue.pollFirst();
if(!maxQueue.isEmpty()&&head.equals(maxQueue.peekLast())){
maxQueue.pollLast();
}
return head;
}
public static void main(String[] args) {
Deque<Integer> s = new ArrayDeque<>();
s.push(1);
s.push(2);
s.push(3);
s.push(4);
s.push(5);
}
}