232.用栈实现队列& 225. 用队列实现栈

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()#少了这个关键元素因为只能执行一次所以在stack_out添加完元素后再弹出值
    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()

 两栈实现队列，将栈先近后出变换为队列先进先出

 225. 用队列实现栈

from collections import deque
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:
        ans = self.pop()
        self.que.append(ans)
        return ans
    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()

 用一个队列实现栈，简化代码运行