用兩個棧實現一個隊列

使用兩個棧實現一個隊列MyQueue

#include <stack>using namespace std;template <class T>class myQueue{public:void push(T val){sin.push(val);}void pop(){move(sin, sout);sout.pop();}T front(){move(sin, sout);return sout.top();}T back(){move(sout, sin);return sin.top();}int size(){return sin.size() + sout.size();}bool empty(){return sin.empty() && sout.empty();}void move(stack<T> &src, stack<T> &dst){if (dst.empty()){while (!src.empty()){dst.push(src.top());src.pop();}}}private:stack<T> sin, sout;};