-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path232.cpp
49 lines (42 loc) · 1000 Bytes
/
232.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
// doubleStacks-0ms.cpp
class MyQueue {
stack<int> in;
stack<int> out;
public:
/** Initialize your data structure here. */
MyQueue() {}
/** Push element x to the back of queue. */
void push(int x) { in.push(x); }
/** Removes the element from in front of queue and returns that element. */
int pop() {
if (out.empty()) {
while (!in.empty()) {
out.push(in.top());
in.pop();
}
}
int temp = out.top();
out.pop();
return temp;
}
/** Get the front element. */
int peek() {
if (out.empty()) {
while (!in.empty()) {
out.push(in.top());
in.pop();
}
}
return out.top();
}
/** Returns whether the queue is empty. */
bool empty() { return in.empty() == 1 && out.empty() == 1; }
};
/**
* 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();
*/