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.

Analyses: Map each character in the string into a index in an array times, size of that array is from ASCII size. During the process of scanning, update the frequencies of each character. Have a variable count to label how many different characters occur. Whenever the count exceeds k, we know that shorten our range: Let the left pointer move right until the frequency of the character pointed by left is 1.

 1 public class Solution {
 2     public int lengthOfLongestSubstringKDistinct(String s, int k) {
 3         int result = 0, left = 0, n = s.length(), count = 0;
 4         int[] times = new int[256]; // map char in s to a index
 5         for (int right = 0; right < n; right++) {
 6             if (times[s.charAt(right)]++ == 0) count++;
 7
 8             if (count > k) {
 9                 while (--times[s.charAt(left++)] > 0);
10                 count--;
11             }
12
13             result = Math.max(result, right - left + 1);
14         }
15         return result;
16     }
17 }

转载于:https://www.cnblogs.com/amazingzoe/p/6768022.html

Longest Substring With At Most K Distinct Characters相关推荐

[LeetCode] Longest Substring with At Most K Distinct Characters 最多有K个不同字符的最长子串...
Given a string, find the length of the longest substring T that contains at most k distinct characte ...
LeetCode 340. Longest Substring with At Most K Distinct Characters
原题链接在这里:https://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters/ 题目: Give ...
386 · Longest Substring with At Most K Distinct Characters最多有k个不同字符的最长子字符串
链接:https://www.lintcode.com/problem/386/description https://mp.weixin.qq.com/s?__biz=MzU2OTUyNzk1NQ= ...
[LeetCode] 159. Longest Substring with At Most Two Distinct Characters 最多有两个不同字符的最长子串...
Given a string S, find the length of the longest substring T that contains at most two distinct char ...
LeetCode 159. Longest Substring with At Most Two Distinct Characters --Java,C++,Python解法
题目地址:Longest Substring with At Most Two Distinct Characters - LeetCode Given a string s , find the l ...
[LeetCode] Longest Substring with At Most Two Distinct Characters 最多有两个不同字符的最长子串...
Given a string S, find the length of the longest substring T that contains at most two distinct char ...
【Lintcode】1375. Substring With At Least K Distinct Characters
题目地址: https://www.lintcode.com/problem/substring-with-at-least-k-distinct-characters/description 给定一 ...
leetcode Longest Substring with At Most Two Distinct Characters 滑动窗口法
题目解析代码如下题目解析这一题是一道会员的题目,题目介绍如下: Given a string, find the length of the longest substring T that c ...
395. Longest Substring with At Least K Repeating Characters
题目要求 Find the length of the longest substring T of a given string (consists of lowercase letters onl ...

Longest Substring With At Most K Distinct Characters

Longest Substring With At Most K Distinct Characters相关推荐

最新文章

热门文章