LintCode-剑指Offer-(40)用栈实现队列

class Queue {public:stack<int> stack1;   stack<int> stack2;    Queue() {    // do intialization if necessary    }    void push(int element) {    // write your code here        while(stack1.empty()==false){            stack2.push(stack1.top());            stack1.pop();        }        stack1.push(element);        while(stack2.empty()==false){            stack1.push(stack2.top());            stack2.pop();        }}int pop() {    // write your code here    int tmp=stack1.top();    stack1.pop();    return tmp;}int top() {    // write your code here    return stack1.top();    }};