代码随想录算法训练营第十天（补） | 225. 用队列实现栈、232.用栈实现队列-CSDN博客

本文链接：https://blog.csdn.net/Schwarzwald5987/article/details/135433945

文章讲述了如何分别用队列实现栈（MyStack）和用两个栈实现队列（MyQueue），展示了如何通过操作队列和栈来模拟这些基本数据结构的操作，如push、pop、top和empty。

摘要由CSDN通过智能技术生成

225. 用队列实现栈

deque是双端队列

用一个队列即可实现栈的push，pop，top和empty功能

pop：将队列第一个元素利用popleft移除再append添加到队尾，从而最后移除目标元素

top：返回目标元素但不移除

class MyStack:

    def __init__(self):
        self.que = deque()

    def push(self, x: int) -> None:
        self.que.append(x)

    def pop(self) -> int:
        if self.empty():
            return None
        
        for i in range(len(self.que) - 1):
            self.que.append(self.que.popleft())
        return self.que.popleft()

    def top(self) -> int:
        if self.empty():
            return None
        
        for i in range(len(self.que) - 1):
            self.que.append(self.que.popleft())

        temp = self.que.popleft()
        self.que.append(temp)
        return temp

    def empty(self) -> bool:
        return not self.que


# Your MyStack object will be instantiated and called as such:
# obj = MyStack()
# obj.push(x)
# param_2 = obj.pop()
# param_3 = obj.top()
# param_4 = obj.empty()

232.用栈实现队列

用队列来模拟栈，并用两个栈来实现队列

class MyQueue:

    def __init__(self):
        self.stack_in = []
        self.stack_out = []

    def push(self, x: int) -> None:
        self.stack_in.append(x)

    def pop(self) -> int:
        if self.empty():
            return None
        if self.stack_out:
            return self.stack_out.pop()
        else:
            for i in range(len(self.stack_in)):
                self.stack_out.append(self.stack_in.pop())
            return self.stack_out.pop()

    def peek(self) -> int:
        ele = self.pop()
        self.stack_out.append(ele)
        return ele


    def empty(self) -> bool:
        return not(self.stack_in or self.stack_out)


# Your MyQueue object will be instantiated and called as such:
# obj = MyQueue()
# obj.push(x)
# param_2 = obj.pop()
# param_3 = obj.peek()
# param_4 = obj.empty()

参考文档：代码随想录