232.用栈实现队列
题目链接: 232.用栈实现队列
思路: 用一个辅助栈进行进出辅助即可(本题目的在于熟悉栈和队列的操作)
代码如下:
class MyQueue {
public:
stack<int> a, b;
MyQueue() {
}
void push(int x) {
a.push(x);
}
int pop() {
while(a.size() > 1){
b.push(a.top());
a.pop();
}
int x = a.top();
a.pop();
while(b.size()) a.push(b.top()), b.pop();
return x;
}
int peek() {
while(a.size() > 1){
b.push(a.top());
a.pop();
}
int x = a.top();
while(b.size()) a.push(b.top()), b.pop();
return x;
}
bool empty() {
return a.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();
*/
225. 用队列实现栈
题目链接: 225. 用队列实现栈
思路: 利用一个辅助队列,当pop时,先将前n - 1个元素存入辅助队列中,在将最后一个元素出队并返回。当top时先将前n - 1个元素出队压入辅助队列中,再将最后一个元素出队,(注意一定要将最后出队的元素也压入辅助队列中),最后将辅助队列的元素再存入原来的队列中。
代码如下:
class MyStack {
public:
queue<int> a, b;
MyStack() {
}
void push(int x) {
a.push(x);
}
int pop() {
while(a.size() > 1){
b.push(a.front());
a.pop();
}
int x = a.front();
a.pop();
while(b.size()){
a.push(b.front());
b.pop();
}
return x;
}
int top() {
while(a.size() > 1){
b.push(a.front());
a.pop();
}
int x = a.front();
a.pop();
b.push(x);
while(b.size()){
a.push(b.front());
b.pop();
}
return x;
}
bool empty() {
return a.empty();
}
};
/**
* 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();
*/