LeetCode-232. Implement Queue using Stacks

Description

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).

Solution 1(C++)

class MyQueue {
public:
    /** Initialize your data structure here. */
    stack<int> s;

    MyQueue() {
        while(!s.empty()){s.pop();}
    }

    /** Push element x to the back of queue. */
    void push(int x) {
        s.push(x);
    }

    /** Removes the element from in front of queue and returns that element. */
    int pop() {
        stack<int> cs;
        while(!s.empty()){
            cs.push(s.top());
            s.pop();
        }
        int popnum=cs.top();
        cs.pop();
        while(!cs.empty()){
            s.push(cs.top());
            cs.pop();
        }
        return popnum;
    }

    /** Get the front element. */
    int peek() {
        stack<int> cs;
        while(!s.empty()){
            cs.push(s.top());
            s.pop();
        }
        int peeknum=cs.top();
        while(!cs.empty()){
            s.push(cs.top());
            cs.pop();
        }
        return peeknum;
    }

    /** Returns whether the queue is empty. */
    bool empty() {
        return s.empty();
    }
};
/**
 * Your MyQueue object will be instantiated and called as such:
 * MyQueue obj = new MyQueue();
 * obj.push(x);
 * int param_2 = obj.pop();
 * int param_3 = obj.peek();
 * bool param_4 = obj.empty();
 */

Solution 2(C++)

class MyQueue {
    stack<int> st1;
    stack<int> st2;
public:
    /** Initialize your data structure here. */
    MyQueue() {

    }

    /** Push element x to the back of queue. */
    void push(int x) {
        while(!st1.empty()) {
            st2.push(st1.top());
            st1.pop();
        }
        st1.push(x);
        while(!st2.empty()) {
            st1.push(st2.top());
            st2.pop();
        }
    }

    /** Removes the element from in front of queue and returns that element. */
    int pop() {
        int x = st1.top();
        st1.pop();
        return x;
    }

    /** Get the front element. */
    int peek() {
        return st1.top();
    }

    /** Returns whether the queue is empty. */
    bool empty() {
        return st1.empty();
    }
};

/**
 * Your MyQueue object will be instantiated and called as such:
 * MyQueue obj = new MyQueue();
 * obj.push(x);
 * int param_2 = obj.pop();
 * int param_3 = obj.peek();
 * bool param_4 = obj.empty();
 */

算法分析

由于stack的特性，只能遵循先进后出。所以可以在push的地方用两个stack进行顺序倒换。或者解法一一样。

程序分析

略。