leetcode: (232) Implement Queue using Stacks

【Question】

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:

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

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

3>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:
    stack<int> sta1;
    stack<int> sta2;
    // Push element x to the back of queue.
    void push(int x) {
        sta1.push(x);
    }

    // Removes the element from in front of queue.
  void pop(void) {
       int temp,i;
	   int len = sta1.size();
       for(i=0;i<len-1;i++)
       {
           temp=sta1.top();
           sta1.pop();
           sta2.push(temp);
       }
       sta1.pop();
        for(i=0;i<len-1;i++)
       {
           temp=sta2.top();
           sta1.push(temp);
           sta2.pop();
       }
    }

    // Get the front element.
    int peek(void) {
        int temp,i;
        int res;
		int len = sta1.size();
        for(i=0;i<len-1;i++)
       {
           temp=sta1.top();
           sta1.pop();
           sta2.push(temp);
       }
       res = sta1.top();
        for(i=0;i<len-1;i++)
       {
           temp=sta2.top();
           sta1.push(temp);
           sta2.pop();
       }
       return res;
    }

    // Return whether the queue is empty.
    bool empty(void) {
         return sta1.empty();
    }
};