leetcode-1221-easy

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.

思路一：分别统计 L 和 R 的数量，数量相等，说明可以算作一个 Balanced Strings

    public int balancedStringSplit(String s) {
        if (s.length() % 2 != 0) {
            return 0;
        }

        char[] chars = s.toCharArray();
        int count1 = 0;
        int count2 = 0;
        int result = 0;
        for (char c : chars) {
            if (c == 'L') count1++;
            if (c == 'R') count2++;

            if (count1 == count2) {
                result++;
                count1 = count2 = 0;
            }
        }

        return result;
    }