# [LeetCode]#1221. Split a String in Balanced Strings

`Input: s = "RLRRLLRLRL"Output: 4Explanation: s can be split into "RL", "RRLL", "RL", "RL", each substring contains same number of 'L' and 'R'.`
`Input: s = "RLLLLRRRLR"Output: 3Explanation: s can be split into "RL", "LLLRRR", "LR", each substring contains same number of 'L' and 'R'.`
`Input: s = "LLLLRRRR"Output: 1Explanation: s can be split into "LLLLRRRR".`
`Input: s = "RLRRRLLRLL"Output: 2Explanation: s can be split into "RL", "RRRLLRLL", since each substring contains an equal number of 'L' and 'R'`
• `1 <= s.length <= 1000`
• `s[i] = 'L' or 'R'`
1. Use dictionary to calculate 'L' and ‘R’ number.
2. If you get L and R number is the same, we get a balance.
3. Re-set dictionary.
4. The example is as below.
`class Solution:    def balancedStringSplit(self, s):        check = {'R': 0, 'L': 0}        count=0        for word in s:            check[word] += 1            if check['R'] == check['L']:                count += 1                check['R'] = 0                check['L'] = 0        return count`

--

--