AcWing 829. 模拟队列
原题链接
简单
作者:
buchiyu
,
2021-05-17 18:18:47
,
所有人可见
,
阅读 225
N = 100010
q = [0]*N
head = tail = 0
def push(x):
global tail
q[tail] = x
tail += 1
def pop():
global head
val = q[head]
head += 1
return val
def empty():
global head, tail
return "YES" if head == tail else "NO"
def query():
global head
return q[head]
m = int(input())
while m:
m -= 1
li = input().split()
op = li[0]
if op == 'push':
push(int(li[1]))
elif op == 'pop':
pop()
elif op == 'empty':
print(empty())
else:
print(query())