class MyQueue:
def __init__(self):
self.A,self.B = [],[]
def push(self, x: int) -> None:
self.A.append(x)
def pop(self) -> int:
peek = self.peek()
self.B.pop()
return peek
def peek(self) -> int:
if self.B:
return self.B[-1]
if not self.A:
return -1
while self.A:
self.B.append(self.A.pop())
return self.B[-1]
def empty(self) -> bool:
return not self.A and not self.B
from collections import deque
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