LeetCode：Implement Stack using Queues

最新推荐文章于 2025-08-08 00:00:33 发布

fullstack_lth

最新推荐文章于 2025-08-08 00:00:33 发布

阅读量354

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode 文章标签： leetcode java

本文链接：https://blog.youkuaiyun.com/u014744118/article/details/49884515

LeetCode 专栏收录该内容

161 篇文章

订阅专栏

本文详细介绍了如何仅使用标准队列操作（如 push、pop、peek 和 isEmpty）来实现栈的基本操作，包括压栈、弹栈、获取栈顶元素和判断栈是否为空。通过两个队列的巧妙组合，实现了栈的全部功能。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

问题描述：

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 emptyoperations 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 {
    // Push element x onto stack.
    Queue<Integer> q1 = new LinkedList<>(); 
    Queue<Integer> q2 = new LinkedList<>(); 
    public void push(int x) {
        q1.offer(x);
    }

    // Removes the element on top of the stack.
    public void pop() {
        while(q1.size() > 1)  q2.offer(q1.poll());
        q1.poll();
        Queue<Integer> q = q1;  
        q1 = q2;  
        q2 = q;  
    }

    // Get the top element.
    public int top() {
        while(q1.size()>1)  q2.offer(q1.poll());
        int x = q1.poll();  
        q2.offer(x);  
        Queue<Integer> q = q1;  
        q1 = q2;  
        q2 = q;  
        return x;  
    }

    // Return whether the stack is empty.
    public boolean empty() {
        return q1.isEmpty();
    }
}