README_EN.md

1221. Split a String in Balanced Strings

中文文档

Description

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.

Solutions

Python3

class Solution:
    def balancedStringSplit(self, s: str) -> int:
        n = res = 0
        for c in s:
            if c == 'L':
                n += 1
            else:
                n -= 1
            if n == 0:
                res += 1
        return res

Java

class Solution {
    public int balancedStringSplit(String s) {
        int n = 0, res = 0;
        for (char c : s.toCharArray()) {
            if (c == 'L') {
                ++n;
            } else {
                --n;
            }
            if (n == 0) {
                ++res;
            }
        }
        return res;
    }
}

C++

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

Go

func balancedStringSplit(s string) int {
	n, res := 0, 0
	for _, c := range s {
		if c == 'L' {
			n++
		} else {
			n--
		}
		if n == 0 {
			res++
		}
	}
	return res
}

...