스택을 이용한 큐 구현
내 풀이
class MyQueue:
def __init__(self):
self.stack1 = []
self.stack2 = []
def push(self, x: int) -> None:
while self.stack1:
self.stack2.append(self.stack1.pop())
self.stack1.append(x)
while self.stack2:
self.stack1.append(self.stack2.pop())
def pop(self) -> int:
"""
Removes the element from in front of queue and returns that element.
"""
return self.stack1.pop()
def peek(self) -> int:
"""
Get the front element.
"""
return self.stack1[-1]
def empty(self) -> bool:
"""
Returns whether the queue is empty.
"""
return len(self.stack1) == 0
