-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathstack.java
More file actions
84 lines (75 loc) · 1.92 KB
/
stack.java
File metadata and controls
84 lines (75 loc) · 1.92 KB
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
74
75
76
77
78
79
80
81
82
83
84
/**
* Created by 박진현 on 2017-09-22.
* input으로 들어온 괄호의 쌍이 맞는가?
*/
import java.util.*;
public class Main {
static Stack<Character> stack = new Stack<Character>();
static boolean[] check;
public static boolean checkExpression(String exp) {
while(!stack.empty()) stack.pop();
for(int i=0; i<exp.length(); i++) {
switch(exp.charAt(i)) {
case '(':
stack.push(exp.charAt(i));
break;
case '[':
stack.push(exp.charAt(i));
break;
case '{':
stack.push(exp.charAt(i));
break;
case ')':
char op = stack.pop();
if(op != '(') {
return false;
}
break;
case ']':
op = stack.pop();
if(op != '[') {
return false;
}
break;
case '}':
op = stack.pop();
if(op != '{') {
return false;
}
break;
}
}
if(stack.empty()) {
return true;
} else {
return false;
}
}
public static void main(String args[]) {
int T;
Scanner sc = new Scanner(System.in);
T = sc.nextInt();
check = new boolean[T];
for(int i=0; i<T; i++) {
String exp = sc.next();
check[i] = checkExpression(exp);
}
for(int i=0; i<T; i++) {
if(check[i]) {
System.out.println("YES");
} else {
System.out.println("NO");
}
}
}
}
/*
()
({[})
([)}
(a{b|}[...hello])
()
(())
({}[]([{}]))
(((
*/