-
Notifications
You must be signed in to change notification settings - Fork 686
Expand file tree
/
Copy pathBalancedBrackets.java
More file actions
48 lines (48 loc) · 1.56 KB
/
BalancedBrackets.java
File metadata and controls
48 lines (48 loc) · 1.56 KB
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
package org.launchcode;
public class BalancedBrackets {
/*
* The function BalancedBrackets should return true if and only if
* the input string has a set of "balanced" brackets.
*
* That is, whether it consists entirely of pairs of opening/closing
* brackets (in that order), none of which mis-nest. We consider a bracket
* to be square-brackets: [ or ].
*
* The string may contain non-bracket characters as well.
*
* These strings have balanced brackets:
* "[LaunchCode]", "Launch[Code]", "[]LaunchCode", "", "[]"
*
* While these do not:
* "[LaunchCode", "Launch]Code[", "[", "]["
*
* @param str - to be validated
* @return true if balanced, false otherwise
*/
// public static boolean hasBalancedBrackets(String str) {
// int brackets = 0;
// for (char ch : str.toCharArray()) {
// if (ch == '[') {
// brackets++;
// } else if (ch == ']') {
// brackets--;
// }
// }
// return brackets == 0;
// }
public static boolean hasBalancedBrackets(String str) {
int brackets = 0;
for (char ch : str.toCharArray()) {
if (str.indexOf(']') < str.indexOf('[')) {
return false;
} else if (str.lastIndexOf('[') > str.lastIndexOf(']') ){
return false;
}else if(ch == '[') {
brackets++;
} else if (ch == ']') {
brackets--;
}
}
return brackets == 0;
}
}