[BOJ] 10845 : 큐

■ 문제풀이

· deque를 활용

· deque 에선 pop()이 아닌 popleft()

 

■ 문제해답

from collections import deque
import sys
input = sys.stdin.readline

n = int(input())

queue = deque()
for _ in range(n):
    s = input().split()
    
    if s[0] == 'push':
        queue.append(s[1])
        
    elif s[0] == 'pop':
        if len(queue) == 0:
            print(-1)
        else:
            print(queue.popleft())
    
    elif s[0] == 'size':
        print(len(queue))
     
    elif s[0] == 'empty':
        if len(queue) == 0:
            print(1)
        else:
            print(0)
            
    elif s[0] == 'front':
        if len(queue) == 0:
            print(-1)
        else:
            print(queue[0])
            
    elif s[0] == 'back':
        if len(queue) == 0:
            print(-1)
        else:
            print(queue[-1])

문제출처 : https://www.acmicpc.net/problem/10845

10845번: 큐