0%

Leetcode716-maxStack

Description

Design a max stack that supports push, pop, top, peekMax and popMax.

  1. push(x) — Push element x onto stack.
  2. pop() — Remove the element on top of the stack and return it.
  3. top() — Get the element on the top.
  4. peekMax() — Retrieve the maximum element in the stack.
  5. popMax() — Retrieve the maximum element in the stack, and remove it. If you find more than one maximum elements, only remove the top-most one.

Example

1
2
3
4
5
6
7
8
9
10
MaxStack stack = new MaxStack();
stack.push(5);
stack.push(1);
stack.push(5);
stack.top(); -> 5
stack.popMax(); -> 5
stack.top(); -> 1
stack.peekMax(); -> 5
stack.pop(); -> 1
stack.top(); -> 5

Note:

  1. -1e7 <= x <= 1e7
  2. Number of operations won’t exceed 10000.
  3. The last four operations won’t be called when stack is empty.

Solution

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
class MaxStack {

private Stack<Integer> st;
private Stack<Integer> stMax;
/** initialize your data structure here. */
public MaxStack() {
st = new Stack<>();
stMax = new Stack<>();
}

public void push(int x) {
st.push(x);
if (stMax.isEmpty())
stMax.push(x);
else{
if (x >= stMax.peek())
stMax.push(x);
else stMax.push(stMax.peek());
}
}

public int pop() {
stMax.pop();
return st.pop();
}

public int top() {
return st.peek();
}

public int peekMax() {
return stMax.peek();
}

public int popMax() {
Stack<Integer> temp = new Stack<>();
int max = stMax.peek();
while(st.peek() != max){
temp.push(st.pop());
stMax.pop();
}
st.pop();
stMax.pop();
while(!temp.isEmpty()){
this.push(temp.pop());
}

return max;
}
}

/**
* Your MaxStack object will be instantiated and called as such:
* MaxStack obj = new MaxStack();
* obj.push(x);
* int param_2 = obj.pop();
* int param_3 = obj.top();
* int param_4 = obj.peekMax();
* int param_5 = obj.popMax();
*/