340. Longest Substring with At Most K Distinct Character

Last updated on Mar 9, 2024

159. Longest Substring with At Most Two Distinct Characters 的泛化版。

class Solution:
    def lengthOfLongestSubstringKDistinct(self, s: str, k: int) -> int:
        fast = 0
        slow = 0
        memo = defaultdict(int)
        res = 0
        while fast < len(s):
            char = s[fast]
            fast += 1

            memo[char] += 1

            while len(memo) > k:
                d = s[slow]
                slow += 1
                memo[d] -= 1
                if memo[d] == 0:
                    del memo[d]
            res = max(res, fast - slow)
        return res