LeetCode340：至多包含 K 个不同字符的最长子串（python）

题解：双指针 滑动窗口（题76类似）

import collections


class Solution(object):
    def lengthOfLongestSubstringKDistinct(self,s:str,k:int)->int:
        ans =0
        left = right = 0
        size = len(s)
        count = collections.Counter()
        while right<size:
            ch1 = s[right]
            count[ch1]+=1
            while len(count)>k:
                ch2 = s[left]
                count[ch2]-=1
                if count[ch2]==0:
                    del count[ch2]
                left += 1
            right += 1
            ans = max(ans,right-left)
        return ans
#测试
a = Solution()
b = a.lengthOfLongestSubstringKDistinct('eceba',2)
print(b)