力扣2730.找到最長的半重復子字符串

• 找到相鄰的相同字母后same ++

  • 再雙指針找到前一組相同字母位置

•   class Solution {public:int longestSemiRepetitiveSubstring(string s) {int res=1,n = s.size(),same=0;for(int i=1,j=0;i<n;i++){if(s[i] == s[i-1] && ++same > 1)for(j++;s[j] != s[j-1];j++) same = 1;res = max(res,i-j+1);}return res;}};