用栈实现队列

用栈实现队列

题目如下：

使用栈实现队列的下列操作：
push(x) – 将一个元素放入队列的尾部。
pop() – 从队列首部移除元素。
peek() – 返回队列首部的元素。
empty() – 返回队列是否为空。
示例:
MyQueue queue = new MyQueue();
queue.push(1);
queue.push(2);
queue.peek(); // 返回 1
queue.pop(); // 返回 1
queue.empty(); // 返回 false

解题思路：

栈是后进先出，队列是先进先出，题目的含义就是希望用后进先出来实现后进后出
通常的解法就是在需要弹出元素的时候，先建立一个缓冲栈，存放后面的2到n个数字，
取出栈中的第一个元素之后，再讲2到n个元素依次压入栈中

python版本实现

//python3版本实现
class MyQueue:

    def __init__(self):
        """
        Initialize your data structure here.
        """
        self.stack = []
        
    def push(self, x: int) -> None:
        """
        Push element x to the back of queue.
        """
        self.stack.append(x)

    def pop(self) -> int:
        """
        Removes the element from in front of queue and returns that element.
        """
        temp=[]
        while self.stack: 
            temp.append(self.stack.pop())
        r = temp.pop()
        while temp: 
            self.stack.append(temp.pop())
        return r
        
    def peek(self) -> int:
        """
        Get the front element.
        """
        temp = []
        while self.stack: 
            temp.append(self.stack.pop())
        r = temp[-1]
        while temp: 
            self.stack.append(temp.pop())
        return r

    def empty(self) -> bool:
        """
        Returns whether the queue is empty.
        """
        return not self.stack

java代码

import java.util.Stack;
class MyQueue {
    private Stack stackFrom;
    private Stack stackTo;
    /** Initialize your data structure here. */
    public MyQueue() {
        stackFrom=new Stack();
        stackTo=new Stack();
    }

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

    /** Removes the element from in front of queue and returns that element. */
    public int pop() {
        while (!stackFrom.isEmpty()){
            stackTo.push(stackFrom.pop());
        }
        int result = (int) stackTo.pop();
        while (!stackTo.isEmpty()){
            stackFrom.push(stackTo.pop());
        }
        return result;
    }

    /** Get the front element. */
    public int peek() {
        while (!stackFrom.isEmpty()){
            stackTo.push(stackFrom.pop());
        }
        int result = (int) stackTo.peek();
        while (!stackTo.isEmpty()){
            stackFrom.push(stackTo.pop());
        }
        return result;
    }

    /** Returns whether the queue is empty. */
    public boolean empty() {
        return stackFrom.isEmpty();
    }
}