232. Implement Queue using Stacks(用栈实现队列操作)

problems:

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.

Example:

MyQueue queue = new MyQueue();

queue.push(1);
queue.push(2);
queue.peek(); // returns 1
queue.pop(); // returns 1
queue.empty(); // returns false

tip:

用栈去实现队列.

solution:

1.在push中,用两个stack实现,顺序与队列刚好相反,操作则一致.

class MyQueue {
public:
    /** Initialize your data structure here. */
    MyQueue() {
        
    }
    
    /** Push element x to the back of queue. */
    void push(int x) {
        stack<int> st2;
       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 p=st1.top();
       st1.pop();
       return p;
    }
    
    /** Get the front element. */
    int peek() {
        return st1.top();
    }
    
    /** Returns whether the queue is empty. */
    bool empty() {
        if(st1.empty()) return true;
        else return false;
    }
private:
    stack<int> st1;
};

/**
 * 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();
 */

2.只在pop和peek操作时将栈中元素位置翻转,这样可以提高效率.

class MyQueue {
public:
    /** Initialize your data structure here. */
    MyQueue() {
        
    }
    
    /** Push element x to the back of queue. */
    void push(int x) {
        st1.push(x);
    }
    
    /** Removes the element from in front of queue and returns that element. */
    int pop() {
      shift_stack();
      int p=st2.top();
        st2.pop();
        return p;
    }
    
    /** Get the front element. */
    int peek() {
       shift_stack();
        int p=st2.top();
        return p;
    }
    
    /** Returns whether the queue is empty. */
    bool empty() {
       return st1.empty()&&st2.empty();
    }
    void shift_stack()
    {
        if(!st2.empty()) return ;
        while(!st1.empty())
        {
            st2.push(st1.top());
            st1.pop();
        }
    }
private:
    stack<int> st1;
    stack<int> st2;
};