-
Notifications
You must be signed in to change notification settings - Fork 110
/
solution.java
75 lines (63 loc) · 2.17 KB
/
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
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
import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.regex.*;
public class Solution {
// function to check if brackets match or not
static boolean Match(char ch1, char ch2) {
if(ch1=='{' && ch2=='}'){ // { }
return true;
}else if(ch1=='[' && ch2==']'){ // [ ]
return true;
}else if(ch1=='(' && ch2==')'){ // ( )
return true;
}else{
return false;
}
}
// function to check if it is balanced
static String isBalanced(String s) {
Stack<Character> st= new Stack<>();
for(int i=0; i<s.length(); i++){ // traversing string
char ch= s.charAt(i); // character of string at index i
if(ch=='{' || ch=='[' || ch=='('){
// encountering opening bracket
st.push(ch);
}else
// iencountering non-opening bracket, first check if stack is empty
if(st.empty()){
return "NO";
}else {
// when stack is not empty
if(Match(st.peek(), ch)){
st.pop();
}else{
return "NO";
}
}
}
// if stack is empty at the end then only it is balanced
if(st.empty()){
return "YES";
}else{
return "NO";
}
}
private static final Scanner scanner = new Scanner(System.in);
public static void main(String[] args) throws IOException {
BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));
int t = scanner.nextInt(); // number of Test cases
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
for (int tItr = 0; tItr < t; tItr++) {
String s = scanner.nextLine(); // string to be checked
String result = isBalanced(s);
bufferedWriter.write(result);
bufferedWriter.newLine();
}
bufferedWriter.close();
scanner.close();
}
}