/
BAEKJOON 10845
73 lines (63 loc) · 1.28 KB
/
BAEKJOON 10845
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
71
72
73
import java.util.Scanner;
class Main {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner in = new Scanner(System.in);
int n = in.nextInt(); //배열 크기를 지정
int rear = -1, front = -1; // rear = 삽입 일어나는 곳, front = 삭제 일어나는 곳
int [] a = new int[n]; // 배열 선언
for (int i = 0; i< n;i++) {
String input = in.next(); // 명령어 입력
switch (input) {
case "push": {
rear++;
a[rear] = in.nextInt();
break;
}
case "pop": {
if(rear == front) {
System.out.println("-1");
}
else {
front++;
System.out.println(a[front]);
}
break;
}
case "size": {
System.out.println(rear-front);
break;
}
case "empty": {
if (rear == front) {
System.out.println("1");
}
else {
System.out.println("0");
}
break;
}
case "front": {
if(rear == front) {
System.out.println("-1");
}
else {
System.out.println(a[front+1]);
}
break;
}
case "back":{
if(rear == front) {
System.out.println("-1");
}
else {
System.out.println(a[rear]);
}
break;
}
default:
System.out.println("똑바로 입력 하세용");
}
}
}
}