-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSolution.hpp
More file actions
78 lines (60 loc) · 1.21 KB
/
Solution.hpp
File metadata and controls
78 lines (60 loc) · 1.21 KB
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
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
#include <queue>
using std::queue;
class Stack {
public:
// Push element x onto stack.
void push(int x) {
if(this->empty())
{
queue1.push(x);
return;
}
if(queue1.empty())
{
queue1.push(x);
while(!queue2.empty())
{
queue1.push(queue2.front());
queue2.pop();
}
}
else
{
queue2.push(x);
while(!queue1.empty())
{
queue2.push(queue1.front());
queue1.pop();
}
}
}
// Removes the element on top of the stack.
void pop() {
if(queue1.empty())
{
queue2.pop();
}
else
{
queue1.pop();
}
}
// Get the top element.
int top() {
if(queue1.empty())
{
return queue2.front();
}
else
{
return queue1.front();
}
}
// Return whether the stack is empty.
bool empty() {
return queue1.empty() && queue2.empty();
}
private:
queue<int> queue1;
queue<int> queue2;
};