読者です 読者をやめる 読者になる 読者になる

340. Longest Substring with At Most K Distinct Characters : Past Google Interview

Problem https://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters/ Given a string, find the length of the longest substring T that contains at most k distinct characters. For example, Given s = "eceba" and k = 2, T…