- Notifications
You must be signed in to change notification settings - Fork 366
/
Copy pathBalanced_Brackets.java
38 lines (33 loc) · 1.2 KB
/
Balanced_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
//For a given a string expression containing only round brackets or parentheses, check if they are balanced or not. Brackets are said to be balanced if the bracket which opens last, closes first.
packageStack;
importjava.util.Stack;
publicclassBalanced_Brackets {
publicstaticbooleancheckBalanced(Stringstr) {
Stack<Character> stack = newStack<>();
for (inti = 0; i < str.length(); i++) {
charch = str.charAt(i);
if (ch == '(' || ch == '{' || ch == '[') {
stack.push(ch);
} elseif( ch=='}' || ch==')' || ch==']' ) {
if(stack.isEmpty()) {
returnfalse;
}
elseif(ch==')' && stack.peek()=='('||ch==']'&& stack.peek()=='['||ch=='}'&& stack.peek()=='{')
stack.pop();
else {
returnfalse;
}
}
}
if(stack.isEmpty()) {
returntrue;
}
else {
returnfalse;
}
}
publicstaticvoidmain(String[] args) {
Stringstring = "{ a + [ b+ (c + d)] + (e + f) }";
System.out.println(checkBalanced(string));
}
}