牛客-TOP101-BM43

import java.util.*;
import java.util.Stack;

public class Solution {

    Deque<Integer> deque1 = new LinkedList<>();
    Deque<Integer> deque2 = new LinkedList<>();
    
    public void push(int node) {
        deque1.addLast(node);
        if(deque2.isEmpty() || deque2.peekLast() > node){
            deque2.addLast(node);
        }else{
            deque2.addLast(deque2.peekLast());
        }
    }
    
    public void pop() {
        deque1.pollLast(); 
        deque2.pollLast();
    }
    
    public int top() {
        return deque1.peekLast();
    }
    
    public int min() {
        return deque2.peekLast();
    }
}
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