9-7每日一题：分割平衡字符串

Leetcode1221. 分割平衡字符串

class Solution {
public:
    int balancedStringSplit(string s) {
        int l = 0, r = 0, cnt = 0;
        for (int i = 0; i < s.size(); i ++ ) {
            if (s[i] == 'L') {
                l ++ ;
                if (l == r) {
                    cnt ++ ;
                    l = 0, r = 0;
                }
            }
            else {
                r ++ ;
                if (l == r) {
                    cnt ++ ;
                    l = 0, r = 0;
                }
            }
            // cout << l << ' ' << r << endl;
        }
        return cnt; 
    }
};