알고리즘
백준 18258 큐2
별은_StarIs_Dev
2025. 1. 19. 20:18
반응형
https://www.acmicpc.net/problem/18258
#백준 18258
# 큐 2
import sys
from collections import deque
n = int(sys.stdin.readline())
queue = deque()
for _ in range(n):
command = sys.stdin.readline().split()
if command[0] == 'push':
queue.append(command[1])
elif command[0] == 'pop':
if queue:
print(queue.popleft())
else:
print(-1)
elif command[0] == 'size':
print(len(queue))
elif command[0] == 'empty':
if queue:
print(0)
else:
print(1)
elif command[0] == 'front':
if queue:
print(queue[0])
else:
print(-1)
elif command[0] == 'back':
if queue:
print(queue[-1])
else:
print(-1)
반응형