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 SplitAStringInBalancedStrings : public Solution {
public:
    void Exec() {

    }
    int balancedStringSplit(string s) {
        int numOfL = 0;
        int numOfR = 0;
        int result = 0;

        for (auto c : s) {
            if (c == 'L') {
                ++numOfL;
            } else {
                ++numOfR;
            }
            if (numOfL == numOfR) {
                ++result;
                numOfL = 0;
                numOfR = 0;
            }
        }
        return result;
    }
};