-
Notifications
You must be signed in to change notification settings - Fork 1
/
225.ImplementStackusingQueues.cpp
58 lines (51 loc) · 1.1 KB
/
225.ImplementStackusingQueues.cpp
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
#include <iostream>
#include <queue>
using namespace std;
class MyStack {
public:
/** Initialize your data structure here. */
queue<int> q1,q2;
MyStack() {
}
/** Push element x onto stack. */
void push(int x) {
q1.push(x);
}
/** Removes the element on top of the stack and returns that element. */
int pop() {
while(q1.size()>1){
q2.push(q1.front());
q1.pop();
}
int popx = q1.front();
q1.pop();
while(!q2.empty()){
q1.push(q2.front());
q2.pop();
}
return popx;
}
/** Get the top element. */
int top() {
int topx = q1.back();
return topx;
}
/** Returns whether the stack is empty. */
bool empty() {
return q1.empty();
}
};
int main()
{
/**
* Your MyStack object will be instantiated and called as such:
*/
MyStack obj;
obj.push(1);
obj.push(2);
obj.push(3);
int param_2 = obj.pop();
int param_3 = obj.top();
bool param_4 = obj.empty();
cout << param_2 << param_3 << param_4 << endl;
}