-
-
Notifications
You must be signed in to change notification settings - Fork 300
/
232.cpp
118 lines (102 loc) · 2.59 KB
/
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
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
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
__________________________________________________________________________________________________
sample 4 ms submission
class MyQueue {
public:
/** Initialize your data structure here. */
MyQueue() {
}
/** Push element x to the back of queue. */
void push(int x) {
stack<int> tmp;
int first = 0;
while(!st.empty())
{
tmp.push(st.top());
st.pop();
}
st.push(x);
while(!tmp.empty())
{
st.push(tmp.top());
tmp.pop();
}
}
/** Removes the element from in front of queue and returns that element. */
int pop() {
int last = st.top();
st.pop();
return last;
}
/** Get the front element. */
int peek() {
return st.top();
}
/** Returns whether the queue is empty. */
bool empty() {
return st.empty();
}
private:
stack<int> st;
};
/**
* 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();
*/
__________________________________________________________________________________________________
sample 8724 kb submission
class MyQueue {
public:
stack<int> s1;
stack<int> s2;
/** Initialize your data structure here. */
MyQueue() {
}
/** Push element x to the back of queue. */
void push(int x) {
s1.push(x);
}
/** Removes the element from in front of queue and returns that element. */
int pop() {
if (s2.empty()){
while(!s1.empty()){
s2.push(s1.top());
s1.pop();
}
}
int top = s2.top();
s2.pop();
return top;
}
/** Get the front element. */
int peek() {
if (s2.empty()){
while(!s1.empty()){
s2.push(s1.top());
s1.pop();
}
}
int top = s2.top();
return top;
}
/** Returns whether the queue is empty. */
bool empty() {
if(s1.empty() && s2.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();
*/
__________________________________________________________________________________________________