# 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 in the maximum amount of balanced strings.

Return  the maximum amount of split balanced strings.

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 = "RLLLLRRRLR"
Output: 3
Explanation: s can be split into "RL", "LLLRRR", "LR", each substring contains same number of 'L' and 'R'.
``````

Example 3:

``````Input: s = "LLLLRRRR"
Output: 1
Explanation: s can be split into "LLLLRRRR".
``````

Example 4:

``````Input: s = "RLRRRLLRLL"
Output: 2
Explanation: s can be split into "RL", "RRRLLRLL", since each substring contains an equal number of 'L' and 'R'
``````

Constraints:

• `1 <= s.length <= 1000`
• `s[i]` is either `'L'` or `'R'`.
• `s` is a balanced string.

``````class Solution {
public:
int balancedStringSplit(string s) {
int res = 0, cnt = 0;
for (char c : s) {
(c == 'L') ? ++cnt : --cnt;
if (cnt == 0) ++res;
}
return res;
}
};
``````

Github 同步地址:

https://github.com/grandyang/leetcode/issues/1221

Valid Parentheses

https://leetcode.com/problems/split-a-string-in-balanced-strings/

https://leetcode.com/problems/split-a-string-in-balanced-strings/discuss/403836/C%2B%2BJavaPython-Easy-Solution

LeetCode All in One 题目讲解汇总(持续更新中…)

 微信打赏 Venmo 打赏
（欢迎加入博主的知识星球，博主将及时答疑解惑，并分享刷题经验与总结，试运营期间前五十位可享受半价优惠～）

×

Help us with donation