Leetcode 225(Java)

最新推荐文章于 2025-04-23 21:53:03 发布

原创最新推荐文章于 2025-04-23 21:53:03 发布 · 890 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#pop #java #leetcode

leetcode 专栏收录该内容

40 篇文章

订阅专栏

本文介绍了一种使用队列的基本操作来实现栈的方法。通过两个队列互相倒换元素，可以巧妙地实现栈的push、pop、top和empty等基本操作。

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

这是我在leetcode遇见的第一道实现数据结构的题目，觉得很有意思。用队列的基本操作来实现栈，想想队列和栈的特性，我们可以用两个队列像漏斗一样互倒，把先进来的元素都漏掉来实现得到最后进去的那个元素。AC码如下：

public class MyStack {
    Queue<Integer> ListA;   
    Queue<Integer> ListB;
    /** Initialize your data structure here. */
    public MyStack() {
        ListA = new LinkedList<Integer>();
        ListB = new LinkedList<Integer>();
    }

    /** Push element x onto stack. */
    public void push(int x) {
        if(!ListA.isEmpty()){
            ListA.add(x);
        }else{
            ListB.add(x);
        }
    }

    /** Removes the element on top of the stack and returns that element. */
    public int pop() {
        int result = 0;
        if(!ListA.isEmpty()){
            while(ListA.size()>1){
                ListB.offer(ListA.poll());
            }
            result =  ListA.poll();
        }else{
            while(ListB.size()>1){
                ListA.offer(ListB.poll());
            }
            result =  ListB.poll();
        }
        return result;
    }

    /** Get the top element. */
    public int top() {
        int result = 0;
        if(!ListA.isEmpty()){
            while(ListA.size()>1){
                ListB.offer(ListA.poll());
            }
            result = ListA.poll();
            ListB.offer(result);
        }else{
            while(ListB.size()>1){
                ListA.offer(ListB.poll());
            }
            result = ListB.poll();
            ListA.offer(result);
        }
        return result;
    }

    /** Returns whether the stack is empty. */
    public boolean empty() {
        return ListA.isEmpty() && ListB.isEmpty();
    }
}