leetcode 232. Implement Queue using Stacks 双栈实现队列

最新推荐文章于 2024-10-30 00:15:00 发布

JackZhangNJU

最新推荐文章于 2024-10-30 00:15:00 发布

阅读量420

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode For Java leetcode For C++

本文链接：https://blog.youkuaiyun.com/jackzhang_123/article/details/78083407

leetcode For C++ 同时被 2 个专栏收录

551 篇文章

订阅专栏

leetcode For Java

502 篇文章

订阅专栏

本文介绍了一种使用两个栈来实现队列的经典算法。通过将元素压入第一个栈并在需要时将其倒置到第二个栈中以保持队列的顺序，实现了队列的基本操作：push、pop、peek和empty。

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

Implement the following operations of a queue using stacks.

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

这道题是也是一个经典的问题，就是考察双栈实现一个队列。

建议和这一道题一起学习leetcode 225. Implement Stack using Queues 双队列实现栈

两个栈实现堆是经典算法。
进队时，压入stk1。
出队时，stk2弹出。
stk2为空时，stk1倒入stk2。两次逆序恢复了原序。

代码如下：

import java.util.Stack;

/*
 * 
 * 两个栈实现堆是经典算法。
 * 进队时，压入stk1。
 * 出队时，stk2弹出。
 * stk2为空时，stk1倒入stk2。两次逆序恢复了原序。
 * */
public class MyQueue 
{
    Stack<Integer> stack1=null;
    Stack<Integer> stack2=null;
    /** Initialize your data structure here. */
    public MyQueue() 
    {
        stack1=new Stack<>();
        stack2=new Stack<>();
    }

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

    /** Removes the element from in front of queue and returns that element. */
    public int pop()
    {
        if(stack2.empty())
        {
            while(stack1.empty()==false)
                stack2.push(stack1.pop());
        }
        return stack2.pop();
    }

    /** Get the front element. */
    public int peek() 
    {
        if(stack2.empty())
        {
            while(stack1.empty()==false)
                stack2.push(stack1.pop());
        }
        return stack2.peek();
    }

    /** Returns whether the queue is empty. */
    public boolean empty() 
    {
        return stack1.empty() && stack2.empty();
    }
}

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