-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathisBalancedStr.java
More file actions
53 lines (44 loc) · 1.52 KB
/
isBalancedStr.java
File metadata and controls
53 lines (44 loc) · 1.52 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
49
50
51
52
53
/* 1221. Split a String in Balanced Strings
* Balanced strings are those that have an equal quantity of 'L' and 'R' characters.
Given a balanced string s, split it into some number of substrings such that:
Each substring is balanced.
Return the maximum number of balanced strings you can obtain.
*
* Example 1:
Input: s = "RLRRLLRLRL"
Output: 4
Explanation: s can be split into "RL", "RRLL", "RL", "RL", each substring contains same number of 'L' and 'R'.
*
* Example 2:
Input: s = "RLRRRLLRLL"
Output: 2
Explanation: s can be split into "RL", "RRRLLRLL", each substring contains same number of 'L' and 'R'.
Note that s cannot be split into "RL", "RR", "RL", "LR", "LL", because the 2nd and 5th substrings are not balanced.
*Example 3:
Input: s = "LLLLRRRR"
Output: 1
Explanation: s can be split into "LLLLRRRR".
*/
public class isBalancedStr {
public static int balancedStringSplit(String s, int index){
if(index >= s.length()) return 0;
int count = 0;
while(index <= s.length()){
if(s.charAt(index) == 'R') count++;
else count--;
if(count == 0){
return 1 + balancedStringSplit(s, index+1);
}
index++;
}
return balancedStringSplit(s, index);
}
public static int balancedStringSplit(String s){
return balancedStringSplit(s, 0);
}
public static void main(String[] args) {
String str = "RLRRRLLRLL";
int result = balancedStringSplit(str);
System.out.println(result);
}
}