代码随想录day10|232. 用栈实现队列225. 用队列实现栈

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.stack_out:
            return self.stack_out.pop()
        else:
            while self.stack_in:
                self.stack_out.append(self.stack_in.pop())
            return self.stack_out.pop()


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


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

232. 用栈实现队列 栈是后进先出，所以对于list只能用append()和pop()，队列是先进先出，完成这个操作要两个栈来转换，push直接append()，pop需要将stack_in倒序放到stack_out中，然后再pop()，需要注意的是stack_out为空时才能这样做，不为空的话顺序会乱。

class MyStack:

    def __init__(self):
        self.queue =[]


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

    def pop(self) -> int:
        _size = len(self.queue)
        for _ in range(_size-1):
            self.queue.append(self.queue.pop(0))
        return self.queue.pop(0)


    def top(self) -> int:
        ans=self.pop()
        self.push(ans)
        return ans

    def empty(self) -> bool:
        return 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()

225. 用队列实现栈