[백준] 10866 덱

💡 문제

https://www.acmicpc.net/problem/10866

10866번: 덱

 

💡 정답

 

from collections import deque
import sys

d = deque()
n = int(input())

for i in range(n):
    comd = list(sys.stdin.readline().split())
    if comd[0] == "push_front":
        d.appendleft(comd[1])
    elif comd[0] == "push_back":
        d.append(comd[1])
    elif comd[0] == "pop_front":
        if len(d)==0:
            print(-1)
        else:
            print(d.popleft())
    elif comd[0] == "pop_back":
        if len(d)==0:
            print(-1)
        else:
            print(d.pop())
    elif comd[0] == "size":
        print(len(d))
    elif comd[0] == "empty":
        if len(d)==0:
            print(1)
        else:
            print(0)
    elif comd[0] == "front":
        if len(d) == 0:
            print(-1)
        else:
            print(d[0])
    elif comd[0] == "back":
        if len(d) == 0:
            print(-1)
        else:
            print(d[-1])

 

💡 풀이

다른 사람 풀이

import sys
a=[]
for i in range(int(sys.stdin.readline().rstrip())):
    x=sys.stdin.readline().rstrip().split();o=x[0]
    if o=='push_front':a.insert(0,x[1])
    elif o=='push_back':a.append(x[1])
    elif o=='pop_front':print(a.pop(0)if a else-1)
    elif o=='pop_back':print(a.pop()if a else-1)
    elif o=='size':print(len(a))
    elif o=='empty':print(0if a else 1)
    elif o=='front':print(a[0]if a else-1)
    else:print(a[-1]if a else-1)