[백준] 10866번 덱 (파이썬)

10866번: 덱

 

코드

import sys

class Deque:
    def __init__(self):
        self.arr = list()

    def push_front(self,x):
        self.arr.insert(0,x)

    def push_back(self,x):
        self.arr.append(x)

    def pop_front(self):
        if self.empty():
            return -1
        else:
            return self.arr.pop(0)

    def pop_back(self):
        if self.empty():
            return -1
        else:
            return self.arr.pop()

    def size(self):
        return len(self.arr)

    def empty(self):
        if self.size() == 0:
            return 1
        else:
            return 0

    def front(self):
        if self.empty():
            return -1
        else:
            return self.arr[0]

    def back(self):
        if self.empty():
            return -1
        else:
            return self.arr[-1]

answer = Deque()
n = int(sys.stdin.readline())
for i in range(n):
    string = sys.stdin.readline().split()

    if string[0] == 'push_front':
        answer.push_front(int(string[1]))
    elif string[0] == 'push_back':
        answer.push_back(int(string[1]))
    elif string[0] == 'pop_front':
        print(answer.pop_front())
    elif string[0] == 'pop_back':
        print(answer.pop_back())
    elif string[0] == 'size':
        print(answer.size())
    elif string[0] == 'empty':
        print(answer.empty())
    elif string[0] == 'front':
        print(answer.front())
    elif string[0] == 'back':
        print(answer.back())