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

232. 用栈实现队列：

---

代码思路

栈实现队列实在pop的时候操作

class MyQueue:

    def __init__(self):
        self.stack1 = []
        self.stack2 = []

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

    def pop(self) -> int:
        while self.stack1:
            self.stack2.append(self.stack1.pop())
        return_num = self.stack2.pop()
        while self.stack2:
            self.stack1.append(self.stack2.pop())
        return return_num
    def peek(self) -> int:
        while self.stack1:
            self.stack2.append(self.stack1.pop())
        return_num = self.stack2[-1]
        while self.stack2:
            self.stack1.append(self.stack2.pop())
        return return_num
    def empty(self) -> bool:
        if len(self.stack1) == 0:
            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. 用队列实现栈：

---

代码思路

队列实现栈实在push的时候操作
保留一个队列始终为空，这样就可以保证新进来那一个元素始终在队伍最前面。

class MyStack:

    def __init__(self):
        """
        Initialize your data structure here.
        """
        self.queue1 = collections.deque()
        self.queue2 = collections.deque()


    def push(self, x: int) -> None:
        """
        Push element x onto stack.
        """
        self.queue2.append(x)
        while self.queue1:
            self.queue2.append(self.queue1.popleft())
        self.queue1, self.queue2 = self.queue2, self.queue1


    def pop(self) -> int:
        """
        Removes the element on top of the stack and returns that element.
        """
        return self.queue1.popleft()


    def top(self) -> int:
        """
        Get the top element.
        """
        return self.queue1[0]


    def empty(self) -> bool:
        """
        Returns whether the stack is empty.
        """
        return not self.queue1







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