Leetcode/leetcode225.cpp at main · ksaini-web/Leetcode · 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
51
52
53
54
55
56
57
58
class MyStack {
public:

queue<int> q1;
        queue<int> q2;
    MyStack() {


    }

    void push(int x) {


        while(!q1.empty()){

           q2.push(q1.front());
           q1.pop();


        }

        q1.push(x);

        while(!q2.empty()){

            q1.push(q2.front());
            q2.pop();
        }
    }

    int pop() {

      int  ans= q1.front();
      q1.pop();
       return ans;

    }

    int top() {

         return q1.front();

    }

    bool empty() {
        return q1.empty();
    }
};

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