Algorithm/BOJ_10866.cpp at main · Yeonjae37/Algorithm · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
#include <bits/stdc++.h>
using namespace std;

deque<int> DQ;

void push_front(int num){
  DQ.push_front(num);
}

void push_back(int num){
  DQ.push_back(num);
}

void pop_front(){
  if(DQ.empty()) cout << -1 << endl;
  else {
    cout << DQ.front() << endl;
    DQ.pop_front();
  }
}

void pop_back(){
  if(DQ.empty()) cout << -1 << endl;
  else {
    cout << DQ.back() << endl;
    DQ.pop_back();
  }
}

void size(){
  cout << DQ.size() << endl;
}

void empty(){
  if(DQ.empty()) cout << 1 << endl;
  else cout << 0 << endl;
}

void front(){
  if(DQ.empty()) cout << -1 << endl;
  else cout << DQ.front() << endl;
}

void back(){
  if(DQ.empty()) cout << -1 << endl;
  else cout << DQ.back() << endl;
}

int main(void){
  int N, num;
  cin >> N;
  string str;
  for (int i = 0; i < N; i++){
    cin >> str;
    if (str == "push_front"){
      cin >> num;
      push_front(num);
    }
    else if (str == "push_back"){
      cin >> num;
      push_back(num);
    }
    else if (str == "pop_front") pop_front();
    else if (str == "pop_back") pop_back();
    else if (str == "size") size();
    else if (str == "empty") empty();
    else if (str == "front") front();
    else if (str == "back") back();
  }
}