Please solve the programming task below using a self-contained code snippet in a markdown code block.

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.
 
Please complete the following python code precisely:
```python
class Solution:
    def balancedStringSplit(self, s: str) -> int:
```