leetcode/src/232.cpp at main · kaanoz1/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
#include <stack>

using namespace std;

class MyQueue
{
private:
    stack<int> stack, stackReverse;

public:
    MyQueue() {}

    void push(int x)
    {
        stack.push(x);
    }

    int pop()
    {
        if (stackReverse.empty())
            while (!stack.empty())
            {
                int topElementOfStack = stack.top();
                stackReverse.push(topElementOfStack);
                stack.pop();
            }

        int lastElement = stackReverse.top();
        stackReverse.pop();
        return lastElement;
    }

    int peek()
    {
        if (stackReverse.empty())
            while (!stack.empty())
            {
                int topElementOfStack = stack.top();
                stackReverse.push(topElementOfStack);
                stack.pop();
            }

        return stackReverse.top();
    }

    bool empty()
    {
        return stack.empty() && stackReverse.empty();
    }
};