232.用栈实现队列
看了答案勉强能写出来,并没有掌握
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())
{
stOut.push(stIn.top());
stIn.pop();
}
}
int result=stOut.top();
stOut.pop();
return result;
}
int peek() {
int res=this->pop();
stOut.push(res);
return res;
}
bool empty() {
return stIn.empty()&&stOut.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.用队列实现栈
class MyStack {
public:
queue<int> que1;
queue<int> que2; //备份作用,将que1除最后一个进来的之外的所有进行备份
MyStack() {
}
void push(int x) {
que1.push(x);
}
int pop() {
int s=que1.size(); //计算que1的元素个数 比如 4 3 2 1 (1是最开始进的),
//但我们想pop掉的是4,但是que1.pop()掉的是1,因为队列是先入先出
//要想和栈一样先入后出,就要重新写一下pop函数
s--;
while(s--)
{
que2.push(que1.front());
que1.pop();
}
int result=que1.front();
que1.pop();
que1=que2;
while(!que2.empty())
{
que2.pop();
}
return result;
}
int top() {
return que1.back();
}
bool empty() {
return que1.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();
*/
对于栈和队列要有一个基本的概念
比如栈 先入后出 pop() ,top()函数用法
比如stack1{4 3 2 1}(先进的是1)那stack1.pop()会弹出4,stack1.top()=4
如果是队列 先入先出 pop(),front(),back()函数
queue1{4 3 2 1} (先进的也是1) 那么queue.pop()弹出的是1,queue.front()=1,queue.back()=4