[leetcode-232] Implement Queue using Stacks

LeetCode-232

Implement Queue using Stacks : Implement a first in first out (FIFO) queue using only two stacks. The implemented queue should support all the functions of a normal queue (push, peek, pop, and empty).

note : sub

선입선출

        :::python

class MyQueue:
    def init(self):
        self.temp = collections.deque()
    def push(self, x: int) -> None:
        self.temp.append(x)
    def pop(self) -> int:   
        return self.temp.popleft()
    def peek(self) -> int:
        return self.temp[0]
    def empty(self) -> bool:
        if len(self.temp) == 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()

Result : 34ms Memory: 13.9mb