232.用栈实现队列
class MyQueue:
def __init__(self):
self.stack_in=[]
self.stack_out=[]
def push(self, x: int) -> None:
#新元素进来,就往in里面push
self.stack_in.append(x)
def pop(self) -> int:
#remove element in front of the stack and return it
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:
#Get the front element
ans = self.pop()
self.stack_out.append(ans)
return ans
def empty(self) -> bool:
#in / out 有元素,就不为空
return not (self.stack_out or self.stack_in)
225. 用队列实现栈
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]
def empty(self) -> bool:
return not self.que