leetcode#232 Implement Queue using Stacks

1. 문제

• https://leetcode.com/problems/implement-queue-using-stacks/
  
  

2. 나의 풀이

class MyQueue:

    def __init__(self):
        self.stack = []
        

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

    def pop(self) -> int:
        if(len(self.stack) > 0):
            return self.stack.pop(0)
        return
        

    def peek(self) -> int:
        if(len(self.stack) > 0):
            return self.stack[0]
        return
        
        
    def empty(self) -> bool:
        if(len(self.stack) > 0):
            return False
        return True
        


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

Reference

• https://realpython.com/how-to-implement-python-stack/