LeetCode 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".

Constraints:

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

---

这题描述的有点复杂……就是给了个string，里面其实已经包含了相等个数的L和R，问你最多能把这个string分成几个L和R相等的substring，这个substring是指真·把string分成几部分，不会有重合的那种，所以其实就很简单，直接无脑count L和R的个数，相等就算一个substring就行了。

class Solution {
    public int balancedStringSplit(String s) {
        int result = 0;
        int countL = 0;
        int countR = 0;
        for (char c : s.toCharArray()) {
            if (c == 'R') {
                countR++;
            } else {
                countL++;
            }
            if (countR == countL) {
                result++;
            }
        }
        return result;
    }
}