-
Notifications
You must be signed in to change notification settings - Fork 0
/
BalancedWorld_4949.java
64 lines (42 loc) · 1.28 KB
/
BalancedWorld_4949.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
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
package stepbystep;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Stack;
// Stack - 짝을 이루는 문자열
// https://www.acmicpc.net/problem/4949
public class BalancedWorld_4949 {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String input;
while (true) {
input = br.readLine();
if (input.equals(".")) break;
if (isBalanced(input)) System.out.println("yes");
else System.out.println("no");
}
}
static Boolean isBalanced(String s) {
Stack<Character> stack = new Stack<>();
for (int i=0; i<s.length(); i++) { // 입력받은 문자열 검사
char c = s.charAt(i);
if (c == '(' || c == '[') { // 여는 괄호를 만나면
stack.push(c); // 스택에 push
}
else if (c == ')') { // 닫는 소괄호를 만나면
if (stack.isEmpty() || stack.peek() != '(') {
return false;
}
else stack.pop();
}
else if (c == ']') { // 닫는 대괄호를 만나면
if (stack.isEmpty() || stack.peek() != '[') {
return false;
}
else stack.pop();
}
}
if (stack.isEmpty()) return true;
else return false;
}
}