【代码随想录训练营】【Day 10】【栈与队列-1】| Leetcode 223, 225

【代码随想录训练营】【Day 10】【栈与队列-1】| Leetcode 223, 225

需强化知识点

• python的栈为list
• python的队列引用，deque

题目

232. 用栈实现队列

• 注意 python 数组反序用法 result [::-1]

class MyQueue:

    def __init__(self):
        self.stack_in = []
        self.stack_out = []
        self.size = 0

    def push(self, x: int) -> None:
        self.stack_in.append(x)
        self.size += 1

    def pop(self) -> int:
        if len(self.stack_out):
            self.size -= 1
            return self.stack_out.pop()
        if len(self.stack_in) == 0:
            return 
        while len(self.stack_in) > 0:
            self.stack_out.append(self.stack_in.pop())
        self.size -= 1
        return self.stack_out.pop()

    def peek(self) -> int:
        ans = self.pop()
        self.stack_out.append(ans)
        self.size += 1
        return ans

    def empty(self) -> bool:
        if self.size <= 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. 用队列实现栈

• 注意 deque的引用和用法，deque的append也是appendright
• 此处和stack实现que不同，需要将最后一位不跳出，然后交换实现
• 可以使用一个deque实现

from collections import deque

class MyStack:

    def __init__(self):
        self.que_in = deque()
        self.que_out = deque()
        self.size = 0

    def push(self, x: int) -> None:
        self.que_in.append(x)
        self.size += 1

    def pop(self) -> int:
        if self.size == 0:
            return
        for _ in range(len(self.que_in)-1):
            self.que_out.append(self.que_in.popleft())
        self.que_in, self.que_out = self.que_out, self.que_in
        self.size -= 1
        return self.que_out.popleft()


    def top(self) -> int:
        ans = self.pop()
        self.que_in.append(ans)
        self.size += 1
        return ans


    def empty(self) -> bool:
        if not self.size:
            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()

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:
        # 写法一：
        # if self.empty():
        #     return None
        # return self.que[-1]

        # 写法二：
        if self.empty():
            return None
        for i in range(len(self.que)-1):
            self.que.append(self.que.popleft())
        temp = self.que.popleft()
        self.que.append(temp)
        return temp

    def empty(self) -> bool:
        return not self.que