출처 : https://leetcode.com/problems/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.

class Solution {
public int balancedStringSplit(String s) {
int numR = 0;
int numL = 0;
int count = 0;
for (int a = 0; a < s.length(); a++) {
if (s.charAt(a) == 'R') {
numR++;
} else if (s.charAt(a) == 'L') {
numL++;
}
if (numR == numL) {
count++;
}
}
return count;
}
}