找到最长的半重复子字符串.py

class half_duplicate_substring:
    def sloution(s):
        ans, left, same = 1, 0, 0
        for right in range(1, len(s)):
            same += s[right] == s[right - 1]
            if same > 1:
                left += 1
                while s[left] != s[left - 1]:
                    left += 1
                same = 1
            ans = max(ans, right - left + 1)
        return ans

s = "52233"
print(half_duplicate_substring.sloution(s))