文章链接:代码随想录 (programmercarl.com)
视频链接:栈的基本操作! | LeetCode:232.用栈实现队列_哔哩哔哩_bilibili
笔记
C++代码
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();
}
};
文章链接:代码随想录 (programmercarl.com)
视频链接:队列的基本操作! | LeetCode:225. 用队列实现栈_哔哩哔哩_bilibili
笔记
C++代码
class MyStack {
public:
queue<int> que1;
queue<int> que2;//backup
MyStack() {
}
void push(int x) {
que1.push(x);
}
int pop() {
int size=que1.size();
size--;//
while(size--){//keep last one
que2.push(que1.front());//backup1->2
que1.pop();
}
int result =que1.front();
que1.pop();//del pop
//2->1
que1=que2;
//clear 2
while(!que2.empty()){
que2.pop();
}
return result;
}
int top() {
return que1.back();
}
bool empty() {
return que1.empty();
}
};