leetcode之 Implement Queue using Stacks

题目:

Implement the following operations of a queue using stacks.

• push(x) -- Push element x to the back of queue.
• pop() -- Removes the element from in front of queue.
• peek() -- Get the front element.
• empty() -- Return whether the queue is empty.

Notes:

• You must use only standard operations of a stack -- which means only push to top, peek/pop from top, size, and is empty operations are valid.
• Depending on your language, stack may not be supported natively. You may simulate a stack by using a list or deque (double-ended queue), as long as you use only standard operations of a stack.
• You may assume that all operations are valid (for example, no pop or peek operations will be called on an empty queue).

解答：

就是两个栈之间来回进行转移即可

class Queue {
public:
    // Push element x to the back of queue.
    void push(int x) {
        if(!stk1.empty())
            stk1.push(x);
        else
        {
            while(!stk2.empty())
            {
                stk1.push(stk2.top());
                stk2.pop();    
            }
            stk1.push(x);
        }
    }


    // Removes the element from in front of queue.
    void pop(void) {
        if(!stk1.empty())
        {
            while(!stk1.empty())
            {
                stk2.push(stk1.top());
                stk1.pop();
            }
            stk2.pop();
        }
        else
        {
            stk2.pop();
        }
    }


    // Get the front element.
    int peek(void) {
        if(!stk1.empty())
        {
            while(!stk1.empty())
            {
                stk2.push(stk1.top());
                stk1.pop();
            }
            return stk2.top();
        }
        else
            return stk2.top();
    }


    // Return whether the queue is empty.
    bool empty(void) {
        return (stk1.empty() && stk2.empty());
    }
private:
    stack<int> stk1;
    stack<int> stk2;
};