Split a String in Balanced Strings
给一个string s, 问能分割成多少平衡的string. 平衡的string就是l和r数量一样多. counting问题.
class Solution {
public int balancedStringSplit(String s) {
int count = 0;
int res = 0;
for(char c : s.toCharArray()) {
if(c == 'L')
count--;
else if(c == 'R')
count++;
if(count == 0)
res++;
}
return res;
}
}