[BOJ] (Swift) 10866 - 덱

10866번: 덱

---

문제 요약

• 덱 (Deque) 만들기

 

풀이

import Foundation

let N = Int(readLine()!)!
var deque: [Int] = []

func push_front(_ x: Int) {
    deque.insert(x, at: 0)
}

func push_back(_ x: Int) {
    deque.append(x)
}

func pop_front() -> Int {
    return deque.isEmpty ? -1 : deque.removeFirst()
}

func pop_back() -> Int {
    return deque.isEmpty ? -1 : deque.removeLast()
}

func size() -> Int {
    return deque.count
}

func empty() -> Int {
    return deque.isEmpty ? 1 : 0
}

func front() -> Int {
    return deque.isEmpty ? -1 : deque.first!
}

func back() -> Int {
    return deque.isEmpty ? -1 : deque.last!
}

for _ in 1...N {
    let command = readLine()!.components(separatedBy: " ")
    switch command[0] {
    case "push_front":
        push_front(Int(command[1])!)
    case "push_back":
        push_back(Int(command[1])!)
    case "pop_front":
        print(pop_front())
    case "pop_back":
        print(pop_back())
    case "size":
        print(size())
    case "empty":
        print(empty())
    case "front":
        print(front())
    case "back":
        print(back())
    default:
        break
    
    }
}