admin管理员组

文章数量:1636922

原题网址：https://leetcode/problems/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.
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).
思路：压栈的时候，使用一个临时队列存储最后压栈的元素（以便最先出队），然后将之前队列的内容逐个添加到临时队列，最后将临时队列覆盖回存放栈数据的队列，实现顺序反转。

源代码：

class MyStack {
    private Queue<Integer> queue = new LinkedList<Integer>();
    private Queue<Integer> buf = new LinkedList<Integer>();
    // Push element x onto stack.
    public void push(int x) {
        buf.add(x);
        while (!queue.isEmpty()) buf.add(queue.remove());
        Queue<Integer> temp = queue;
        queue = buf;
        buf = temp;
    }

    // Removes the element on top of the stack.
    public void pop() {
        queue.remove();
    }

    // Get the top element.
    public int top() {
        return queue.peek();
    }

    // Return whether the stack is empty.
    public boolean empty() {
        return queue.isEmpty();
    }
}
时间复杂度：压栈O(n)，出栈、查看栈顶为O(1)，空间复杂度为O(n)





本文标签： 队列来实现LeetCodeimplementqueues

版权声明：本文标题：LeetCode 225. Implement Stack using Queues（使用队列来实现栈） 内容由热心网友自发贡献，该文观点仅代表作者本人， 转载请联系作者并注明出处：https://www.elefans.com/xitong/1729234747a1191863.html， 本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌抄袭侵权/违法违规的内容，一经查实，本站将立刻删除。