#include <iostream> #include <stack> using namespace std;// 用兩個stack實現一個queue, 以int類型為例吧 class MyQueque { private:stack<int> s1; // s1負責入隊stack<int> s2; // s2負責出隊public:// 入隊void push(int x){s1.push(x);}// 出隊void pop(){if(!s2.empty()){s2.pop();}else{while(!s1.empty()){int tmp = s1.top();s1.pop();s2.push(tmp);}s2.pop();}}// 取頭int front(){if(!s2.empty()){return s2.top();}while(!s1.empty()){int tmp = s1.top();s1.pop();s2.push(tmp);}return s2.top();}// 取尾int back(){if(!s1.empty()){return s1.top();}while(!s2.empty()){int tmp = s2.top();s2.pop();s1.push(tmp);}return s1.top();}// 求大小int size(){return s1.size() + s2.size();}// 判斷是否為空bool empty(){if(s1.empty() && s2.empty()){return true;}return false;} };int main() {{MyQueque que;que.push(1);que.push(2);que.push(3);que.push(4);que.push(5);while(!que.empty()){cout << que.front() << endl;que.pop();}cout << "-------------------" << endl;}{MyQueque que;que.push(1);que.push(2);que.push(3);que.push(4);que.push(5);while(!que.empty()){cout << que.size() << endl;que.pop();}cout << "-------------------" << endl;}{MyQueque que;que.push(1);que.push(2);que.push(3);que.pop();que.pop();que.push(4);que.push(5);while(!que.empty()){cout << que.front() << endl;que.pop();}cout << "-------------------" << endl;}return 0; }

總結

以上是生活随笔為你收集整理的两个栈来实现一个队列的C++代码的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。