LeetCode----Implement Queue using Stacks

最新推荐文章于 2021-03-05 15:45:20 发布

原创最新推荐文章于 2021-03-05 15:45:20 发布 · 631 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#栈 #队列 #LeetCode #python

Python 同时被 3 个专栏收录

127 篇文章

订阅专栏

算法之美

95 篇文章

订阅专栏

编程之美

93 篇文章

订阅专栏

本文详细阐述了如何仅利用标准栈操作（如压栈、弹栈、获取栈大小和判断是否为空）来实现队列的基本操作，包括入队、出队、查看队首元素和判断队列是否为空。通过两个栈的巧妙运用，实现了队列的功能。

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

Implement Queue using Stacks

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

分析：

用栈实现队列，需要两个栈来回传输元素。

代码：

class Queue(object):
    def __init__(self):
        """
        initialize your data structure here.
        """
        self.st1 = []
        self.st2 = []

    def push(self, x):
        """
        :type x: int
        :rtype: nothing
        """
        self.move(self.st1, self.st2)
        self.st1.append(x)

    def pop(self):
        """
        :rtype: nothing
        """
        self.move(self.st2, self.st1)
        self.st2.pop()

    def peek(self):
        """
        :rtype: int
        """
        self.move(self.st2, self.st1)
        return self.st2[-1]

    def empty(self):
        """
        :rtype: bool
        """
        if self.st1 or self.st2:
            return False
        return True

    def move(self, st1, st2):
        """
        :Move st2 to st1
        """
        while st2:
            st1.append(st2.pop())