Algorithm/덱.cpp at master · katie0809/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
#include <stdio.h>
#include <deque>
#include <string>
#include <iostream>
using namespace std;
int num; //명령의 개수

int main(){

  deque<int> DQ;
  string str;

  scanf("%d", &num);

  while(num--){
    cin >> str;

    if(str == "push_front"){
      int tmp;
      scanf("%d", &tmp);
      DQ.push_front(tmp);
      continue;
    }else if(str == "push_back"){
      int tmp;
      scanf("%d", &tmp);
      DQ.push_back(tmp);
      continue;
    }else if(str == "pop_front"){
      int tmp;
      if(DQ.size() == 0) printf("-1\n");
      else{
        printf("%d\n", DQ.front());
        DQ.pop_front();
      }
      continue;
    }else if(str == "pop_back"){
      int tmp;
      if(DQ.size() == 0) printf("-1\n");
      else{
        printf("%d\n", DQ.back());
        DQ.pop_back();
      }
      continue;
    }else if(str == "size"){
      printf("%d\n", DQ.size());
      continue;
    }else if(str == "empty"){
      if(DQ.empty()) printf("1\n");
      else printf("0\n");
      continue;
    }else if(str == "front"){
      if (!DQ.empty())
				printf("%d\n", DQ.front());
			else
				printf("-1\n");
      continue;
    }else if(str == "back"){
      if (!DQ.empty())
        printf("%d\n", DQ.back());
      else
        printf("-1\n");
      continue;
    }
  }

  return 0;
}