Leetcode| 232. 用栈实现队列、225. 用队列实现栈 Day10

232. Implement Queue using Stacks

class MyQueue:

    def __init__(self):
        self.in_stack = []
        self.out_stack = []
        

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

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

        if self.out_stack:
            return self.out_stack.pop()
        else:
            while self.in_stack != []:
                self.out_stack.append(self.in_stack.pop())
            return self.out_stack.pop()

        

    def peek(self) -> int:
        res = self.pop()
        self.out_stack.append(res)

        return res

    def empty(self) -> bool:
        if self.in_stack == [] and self.out_stack == []:
            return True
        else:
            return False

# 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. Implement Stack using Queues

一个队列实现

from collections import deque
class MyStack:

    def __init__(self):
        self.queue = deque()
        # only use append() and popleft()
        
    def push(self, x: int) -> None:
        self.queue.append(x)    

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

        for _ in range(len(self.queue) - 1):
            self.queue.append(self.queue.popleft())
            # Now the element is on the left of the queue
        return self.queue.popleft()

    def top(self) -> int:
        res = self.pop()
        self.queue.append(res)
        return res
        
    def empty(self) -> bool:
        if len(self.queue) == 0:
            return True
        else:
            return False
       
# 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()

两个队列实现

from collections import deque

class MyStack:

    def __init__(self):
        """
        in - 存所有数据
        out - 仅在pop的时候会用到
        """
        self.queue_in = deque()
        self.queue_out = deque()

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

    def pop(self) -> int:
        """
        1. 首先确认不空
        2. 因为队列的特殊性，FIFO，所以我们只有在pop()的时候才会使用queue_out
        3. 先把queue_in中的所有元素（除了最后一个），依次出列放进queue_out
        4. 交换in和out，此时out里只有一个元素
        5. 把out中的pop出来，即是原队列的最后一个
        
        tip：这不能像栈实现队列一样，因为另一个queue也是FIFO，如果执行pop()它不能像
        stack一样从另一个pop()，所以干脆in只用来存数据，pop()的时候两个进行交换
        """
        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    # 交换in和out，这也是为啥in只用来存
        return self.queue_out.popleft()

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

    def empty(self) -> bool:
        """
        因为只有in存了数据，只要判断in是不是有数即可
        """
        return len(self.queue_in) == 0