代码随想录算法训练营第10天|232.用栈实现队列 225. 用队列实现栈

232. 用栈实现队列 
纯模拟 搞一个输入栈和输出栈 注意判断empty

class MyQueue:
    def __init__(self):
        self.ins=[]
        self.out=[]
    def push(self, x: int) -> None:
        self.ins.append(x)
    def pop(self) -> int:
        if self.empty():return
        if self.out:
            return self.out.pop()
        while self.ins:
            self.out.append(self.ins.pop())
        return self.out.pop()
    def peek(self) -> int:
        if self.out:
            return self.out[-1]
        while self.ins:
            self.out.append(self.ins.pop())
        return self.out[-1]

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

 225. 用队列实现栈
注意一个队就可以实现栈了

就是每个元素弹出的时候就疯狂循环，把前面的都转到后面去

class MyStack:
    def __init__(self):
        self.queue=[]
    def push(self, x: int) -> None:
        self.queue.append(x)
    def pop(self) -> int:
        if self.empty():return
        l=len(self.queue)
        for _ in range(l-1):
            self.queue.append(self.queue.pop(0))
        return self.queue.pop(0)
    def top(self) -> int:
        if self.empty(): return
        l=len(self.queue)
        for _ in range(l-1):
            self.queue.append(self.queue.pop(0))
        res=self.queue.pop(0)
        self.queue.append(res)
        return res
    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()