Given a string, find the length of the longest substring T that contains at mostkdistinct characters.
T is "ece" which its length is 3.
class Solution {
public int lengthOfLongestSubstringKDistinct(String s, int k) {
if (s.length() <= k) {
return s.length();
}
int maxLen = 0, start = 0, end = 0, count = 0;
int[] map = new int[256];
while (end < s.length()) {
if (map[s.charAt(end)] == 0) {
++count;
}
++map[s.charAt(end)];
++end;
while (count > k) {
if (map[s.charAt(start)] == 1) {
--count;
}
--map[s.charAt(start)];
++start;
}
maxLen = Math.max(maxLen, end - start);
}
return maxLen;
}
}