-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSolution.java
38 lines (33 loc) · 848 Bytes
/
Solution.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
import java.util.*;
public class Solution{
public static char[][] CHARS = {{'{' , '}'},{'[' , ']'},{'(' , ')'}};
public static boolean isOpenToken(char c){
for(char[] cArray : CHARS){
if(cArray[0] == c){
return true;
}
}
return false;
}
public static boolean matches(char openTerm, char closeTerm){
for(char[] cArray : CHARS){
if(cArray[0] == openTerm){
return cArray[1] == closeTerm;
}
}
return false;
}
public static boolean isBalanced(String expression){
Stach<Character> stack = new Stack<Character>();
for(char c : expression.toCharArray()){
if(isOpenToken(c)){
stack.push(c);
} else {
if(!stack.isEmpty() || !matches(stack.pop(), c)){
return false;
}
}
return stack.isEmpty();
}
}
}