232. Implement Queue using Stacks
class MyQueue {
public:
/** Initialize your data structure here. */
stack<int> S1, S2;
MyQueue() {
}
/** Push element x to the back of queue. */
void push(int x) {
while(!S2.empty()) {
S1.push(S2.top());
S2.pop();
}
S1.push(x);
while(!S1.empty()) {
S2.push(S1.top());
S1.pop();
}
}
/** Removes the element from in front of queue and returns that element. */
int pop() {
int ans = S2.top();
S2.pop();
return ans;
}
/** Get the front element. */
int peek() {
return S2.top();
}
/** Returns whether the queue is empty. */
bool empty() {
return S2.empty();
}
};
/**
* 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();
*/
class MyQueue {
public:
/** Initialize your data structure here. */
stack<int> S1, S2;
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() {
while(!S1.empty()) {
S2.push(S1.top());
S1.pop();
}
int ans = S2.top();
S2.pop();
while(!S2.empty()) {
S1.push(S2.top());
S2.pop();
}
return ans;
}
/** Get the front element. */
int peek() {
while(!S1.empty()) {
S2.push(S1.top());
S1.pop();
}
int ans = S2.top();
while(!S2.empty()) {
S1.push(S2.top());
S2.pop();
}
return ans;
}
/** Returns whether the queue is empty. */
bool empty() {
return S1.empty();
}
};
/**
* 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();
*/