【字符串】1221. 分割平衡字符串

 1 class Solution {
 2 public:
 3     int balancedStringSplit(string s) 
 4     {
 5         if (s.size() < 2) 
 6         {
 7             return 0;
 8         }
 9 
10         int res = 0;
11         int count = 1;
12     
13         if (s[0] == ‘R‘)
14          {
15             count = -1;
16         }
17     
18         for (int  i = 1; i < s.size(); i++)
19         {
20             if (‘R‘ == s[i])
21             {
22                 count--;
23             }
24             else if (‘L‘ == s[i])
25             {
26                 count++;
27             }
28             if (count == 0)
29             {
30                 res++;
31             }  
32         } 
33 
34         return res;
35     }
36 };