MyLeetcode/cpp_solutions/232.cpp at main · Kaminyou/MyLeetcode · GitHub

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
class MyQueue {
public:
    int cnt = 0;
    stack<int> in;
    stack<int> out;
    MyQueue() {

    }

    void push(int x) {
        cnt++;
        in.push(x);
    }

    int pop() {
        trasfer();
        cnt--;
        int x = out.top();
        out.pop();
        return x;
    }

    int peek() {
        trasfer();
        return out.top();
    }

    bool empty() {
        return cnt == 0;
    }

    void trasfer() {
        if (out.empty()) {
            while (!in.empty()) {
                int x = in.top();
                in.pop();
                out.push(x);
            }
        }
    }
};

/**
 * Your MyQueue object will be instantiated and called as such:
 * MyQueue* obj = new MyQueue();
 * obj->push(x);
 * int param_2 = obj->pop();
 * int param_3 = obj->peek();
 * bool param_4 = obj->empty();
 */