代码随想录算法训练营第十日| LC232.用栈实现队列，LC225. 用队列实现栈

LC232.用栈实现队列：

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:
        ans = self.pop()
        self.stack_out.append(ans)
        return ans


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

用两个stack完成。

LC225. 用队列实现栈

class MyStack:

    def __init__(self):
        self.queue_in = deque()
        self.queue_out = deque()

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

    def pop(self) -> int:
        if self.empty():
            return None

        for i in range(len(self.queue_in) - 1):
            self.queue_out.append(self.queue_in.popleft())
        
        self.queue_in, self.queue_out = self.queue_out, self.queue_in    
        return self.queue_out.popleft()

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

    def empty(self) -> bool:
        return len(self.queue_in) == 0

两个queue来完成