-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSWEA1218.java
48 lines (41 loc) · 1.35 KB
/
SWEA1218.java
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
/*
* SWEA 1218번(D4) - 괄호 짝짓기
* stack 활용
*/
import java.util.Scanner;
import java.util.Stack;
public class SWEA1218 {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
for (int tc=1; tc<=10; tc++) {
Stack<Character> stack = new Stack<>();
int len = scan.nextInt();
String s = scan.next();
for (int i=0; i<len; i++) {
char c = s.charAt(i);
if (c == '(' || c == '[' || c == '{' || c == '<') {
stack.push(c);
}
else if (c == ')') {
if (!(stack.peek() == '(')) break;
stack.pop();
}
else if (c == ']') {
if (!(stack.peek() == '[')) break;
stack.pop();
}
else if (c == '}') {
if (!(stack.peek() == '{')) break;
stack.pop();
}
else if (c == '>') {
if (!(stack.peek() == '<')) break;
stack.pop();
}
}
int answer = 1; // 1: 유효함, 0: 유효하지 않음
if (!stack.isEmpty()) answer = 0;
System.out.println("#" + tc + " " + answer);
}
}
}