【LeetCode-232】 Implement Queue using Stacks(C++)

题目要求：用站实现队列的插入，删除，返回队头元素和判断是否为空四种操作。

解题方法：用两个栈实现队列。代码如下：

class Queue {
public:
    // Push element x to the back of queue.
    void push(int x) {
        s1.push(x);
    }

    // Removes the element from in front of queue.
    void pop(void) {
        if(s2.size()==0){
            while(s1.size()>0){
                int data=s1.top();
                s1.pop();
                s2.push(data);
            }
        }
        s2.pop();
    }

    // Get the front element.
    int peek(void) {
        if(s2.size()==0){
            while(s1.size()>0){
                int data=s1.top();
                s1.pop();
                s2.push(data);
            }
        }
        return s2.top();
    }
    // Return whether the queue is empty.
    bool empty(void) {
        if(s1.empty()&&s2.empty())
           return true;
        else
           return false;
    }
private:
    stack<int> s1;
    stack<int> s2;
};