forked from Nandinig24/Leetcode-Solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path232
64 lines (52 loc) · 1.13 KB
/
232
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
class MyQueue {
public:
stack<int>st1,st2;
MyQueue() {
}
void push(int x) {
while(!st1.empty()){
st2.push(st1.top());
st1.pop();
}
st2.push(x);
while(!st2.empty()){
st1.push(st2.top());
st2.pop();
}
}
int pop() {
// (s1.empty()){
// for(auto i:s2){
// s1.push(i);
// }
// return s1.top();
// s2.pop();
// }
// if(s2.empty()){
// for(auto i:s1){
// s2.push(i);
// }
// return s2.top();
// s2.pop();
// }
int x=st1.top();
st1.pop();
return x;
}
int peek() {
return st1.top();
}
bool empty() {
if(st1.empty() && st2.empty())
return true;
return false;
}
};
/**
* 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();
*/