-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathbalancing_brackets.java
41 lines (36 loc) · 1.31 KB
/
balancing_brackets.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
import java.util.Scanner;
class balancing_brackets {
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
System.out.print("Enter Brackets : ");
String b = sc.next();
sc.close();
String b1 = b;
char c1, c2;
int l = 0;
while(b.compareTo("") != 0) {
l = b.length();
for(int i = 0; i < b.length() - 1; i++) {
c1 = b.charAt(i);
c2 = b.charAt(i + 1);
if(c1 == '<' && c2 == '>')
b = b.substring(0, i) + b.substring(i + 2, b.length());
else if(c1 == '[' && c2 == ']')
b = b.substring(0, i) + b.substring(i + 2, b.length());
else if(c1 == '(' && c2 == ')')
b = b.substring(0, i) + b.substring(i + 2, b.length());
else if(c1 == '{' && c2 == '}')
b = b.substring(0, i) + b.substring(i + 2, b.length());
}
System.out.println(b);
if(l == b.length()) {
l = -1;
break;
}
}
if(l == -1)
System.out.println(b1 + " is unbalanced");
else
System.out.println(b1 + " is balanced");
}
}