-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathchallenges-104.js
72 lines (55 loc) · 1.58 KB
/
challenges-104.js
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
// #Question 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".
// #Solution
function balancedStringSplit(s) {
let balancedCount = 0;
let countL = 0;
let countR = 0;
for (let i = 0; i < s.length; i++) {
if (s[i] === "L") {
countL++;
} else {
countR++;
}
if (countL === countR) {
balancedCount++;
countL = 0;
countR = 0;
}
}
return balancedCount;
}
console.log(balancedStringSplit("RLRRRLLRLL"));
// ------------------or -------------------------
function balancedStringSplit(s) {
let balance = 0;
let count = 0;
for (let i = 0; i < s.length; i++) {
if (s[i] === "R") {
balance++;
} else {
balance--;
}
if (balance === 0) {
count++;
}
}
return count;
}
balancedStringSplit("RLRRRLLRLL");