* 判断当前字母和下一个字母是否相同的技巧——找分解线
if (i == s.size() - 1 || s[i] != s[i + 1])
代码:
class Solution {
public:
int findTheLongestBalancedSubstring(string s) {
int ans = 0, pre = 0, cur = 0;
for (int i = 0; i < s.size(); i ++ ) {
cur ++ ;
if (i == s.size() - 1 || s[i] != s[i + 1]) {
if (s[i] == '1')
ans = max(ans, min(pre, cur) * 2);
pre = cur;
cur = 0;
}
}
return ans;
}
};