【leetcode】-225. Implement Stack using Queues 用队列实现栈

题目

Implement the following operations of a stack using queues.

push(x) – Push element x onto stack.
pop() – Removes the element on top of the stack.
top() – Get the top element.
empty() – Return whether the stack is empty.

Example:

MyStack stack = new MyStack();

stack.push(1);
stack.push(2);
stack.top(); // returns 2
stack.pop(); // returns 2
stack.empty(); // returns false
Notes:

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

队列实现栈

队列的入队的一端当作栈顶，取栈顶元素直接返回队尾元素就可以，需要处理的是出栈元素，栈的特点是先进后出，只能从队头取，那么可以把队列前面的都取出来再加入队尾，让之前的队尾元素排到队头。

Java代码

class MyStack {
    
    private Queue<Integer> q;
    int top_elem;

    /** Initialize your data structure here. */
    public MyStack() {
        
        q = new LinkedList<>();
        top_elem = 0;
        
    }
    
    /** Push element x onto stack. */
    public void push(int x) {
        q.offer(x);
        top_elem = x;
    }
    
    /** Removes the element on top of the stack and returns that element. */
    public int pop() {
        int size = q.size();
        while (size>2){
            q.offer(q.poll());
            size--;
        }
        top_elem = q.peek();
        q.offer(q.poll());
        return q.poll();
        
    }
    
    /** Get the top element. */
    public int top() {
        return top_elem;
    }
    
    /** Returns whether the stack is empty. */
    public boolean empty() {
        return q.isEmpty();
    }
}

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

python代码

class MyStack:

    def __init__(self):
        """
        Initialize your data structure here.
        """
        self.q = []
        self.top_elem = 0
        

    def push(self, x: int) -> None:
        """
        Push element x onto stack.
        """
        self.q.append(x)
        self.top_elem = x
        

    def pop(self) -> int:
        """
        Removes the element on top of the stack and returns that element.
        """
        n = len(self.q)
        while n>2:
            self.q.append(self.q.pop(0))
            n -= 1
        self.top_elem = self.q[0]
        self.q.append(self.q.pop(0))
        return self.q.pop(0)
        
        

    def top(self) -> int:
        """
        Get the top element.
        """
        return self.top_elem
        

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


# Your MyStack object will be instantiated and called as such:
# obj = MyStack()
# obj.push(x)
# param_2 = obj.pop()
# param_3 = obj.top()
# param_4 = obj.empty()