-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path0232.cpp
78 lines (67 loc) · 1.24 KB
/
0232.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
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
#include <iostream>
#include <vector>
#include <stack>
using namespace std;
class MyQueue
{
public:
stack<int> stIn;
stack<int> stOut;
MyQueue()
{
}
void push(int x)
{
stIn.push(x);
}
int pop()
{
if (stOut.empty())
{
while (!stIn.empty())
{
int x = stIn.top();
stOut.push(x);
stIn.pop();
}
}
int x = stOut.top();
stOut.pop();
return x;
}
int peek()
{
int x = pop();
stOut.push(x);
return x;
}
bool empty()
{
if (stIn.empty() && stOut.empty())
return true;
else
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();
*/
int main()
{
MyQueue *queue = new MyQueue();
queue->push(1);
queue->push(2);
queue->pop(); // 注意此时的输出栈的操作
queue->push(3);
queue->push(4);
queue->pop();
queue->pop(); // 注意此时的输出栈的操作
queue->pop();
queue->empty();
return 0;
}