Day10 232.用栈实现队列● 225. 用队列实现栈

232.用栈实现队列

不小心把pop函数中的ans写进了循环体之中，导致一直找不到错误

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:
        #     ans =self.stack_out.pop()
        # else:
        #     for i in range(len(self.stack_in)):
        #         self.stack_out.append(self.stack_in.pop())
        #         ans = self.stack_out.pop()
        # return ans
        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)



# 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. 用队列实现栈

主要是要注意一下pop的实现，用两个双端队列来实现

注意一下queue()的几个接口，popleft()

以及注意一下queue的索引，top是取出来queue的-1的位置

class MyStack:

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

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

    def pop(self) -> int:
        if not self.empty:return None
        for i 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
        return self.que_out.popleft()
    def top(self) -> int:
        return self.que_in[-1]


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



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