【训练营】Day10 栈与队列

Day10 栈与队列

1. 理论基础

栈提供push 和 pop 等等接口，所有元素必须符合先进后出规则，所以栈不提供走访功能，也不提供迭代器(iterator)。 不像是set 或者map 提供迭代器iterator来遍历所有元素。

2. 用栈实现队列

● 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:
        # 用我们的pop先弹出来然后再加到出栈里
        res = self.pop()
        self.stack_out.append(res)
        return res



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

3. 用队列实现栈

● 225. 用队列实现栈

class MyStack:

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

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


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

    def top(self) -> int:
        if self.empty(): return None
        return self.queue[-1]


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



        # 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()