232. 用栈实现队列
class MyQueue {
public:
stack<int> in;
stack<int> out;
int size = 0;
MyQueue() {
}
void push(int x) {
this->in.push(x);
this->size++;
}
int pop() {
if (this->out.empty()==true)
{
while(this->in.empty()!=true)
{
this->out.push(this->in.top());
this->in.pop();
}
}
this->size--;
int num = this->out.top();
this->out.pop();
return num;
}
int peek() {
if (this->out.empty()==true)
{
while (!this->in.empty())
{
this->out.push(this->in.top());
this->in.pop();
}
}
return this->out.top();
}
bool empty() {
if (this->size<=0) 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();
*/
225. 用队列实现栈
class MyStack {
public:
queue<int> que1;
queue<int> que2;
int size = 0;
MyStack() {
}
void push(int x) {
que1.push(x);
size++;
}
int pop() {
while (que1.size()>1)
{
que2.push(que1.front());
que1.pop();
}
int num = que1.front();
que1.pop();
while (!que2.empty())
{
que1.push(que2.front());
que2.pop();
}
size--;
return num;
}
int top() {
return que1.back();
}
bool empty() {
if (size<=0) return true;
return false;
}
};
/**
* Your MyStack object will be instantiated and called as such:
* MyStack* obj = new MyStack();
* obj->push(x);
* int param_2 = obj->pop();
* int param_3 = obj->top();
* bool param_4 = obj->empty();
*/