原題鏈接在這里：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 is "ece" which its length is 3.

題解：

類似Longest Substring with At Most Two Distinct Characters.

2變成k即可.

Time Complexity: O(n), n = s.length(). Space: O(1), map size.

AC Java:

1 public class Solution { 2 public int lengthOfLongestSubstringKDistinct(String s, int k) { 3 int res = 0; 4 int [] map = new int[256]; 5 int walker = 0; 6 int runner = 0; 7 int count = 0; 8 while(runner < s.length()){ 9 if(map[s.charAt(runner++)]++ == 0){ 10 count++; 11 } 12 while(count > k){ 13 if(map[s.charAt(walker++)]-- == 1){ 14 count--; 15 } 16 } 17 res = Math.max(res, runner - walker); 18 } 19 return res; 20 } 21 }

跟上Longest Repeating Character Replacement.

轉載于:https://www.cnblogs.com/Dylan-Java-NYC/p/6384945.html

總結

以上是生活随笔為你收集整理的LeetCode 340. Longest Substring with At Most K Distinct Characters的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。