[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 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就行了，具体讲解请参考之前那篇博客：

解法一：

class Solution {
public:int lengthOfLongestSubstringKDistinct(string s, int k) {int res = 0, left = 0;unordered_map<char, int> m;for (int i = 0; i < s.size(); ++i) {++m[s[i]];while (m.size() > k) {if (--m[s[left]] == 0) m.erase(s[left]);++left;}res = max(res, i - left + 1);}return res;}
};

具体讲解请参考之前那篇博客Longest Substring with At Most Two Distinct Characters，参见代码如下：

解法二：

class Solution {
public:int lengthOfLongestSubstringKDistinct(string s, int k) {int res = 0, left = 0;unordered_map<char, int> m;for (int i = 0; i < s.size(); ++i) {m[s[i]] = i;while (m.size() > k) {if (m[s[left]] == left) m.erase(s[left]);++left;}res = max(res, i - left + 1);}return res;}
};

类似题目：

Longest Substring with At Most Two Distinct Characters

LeetCode All in One 题目讲解汇总(持续更新中...)

[LeetCode] Longest Substring with At Most K Distinct Characters 最多有K个不同字符的最长子串...相关推荐

[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 ...
[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 Longest Substring with At Most Two Distinct Characters 滑动窗口法
题目解析代码如下题目解析这一题是一道会员的题目,题目介绍如下: Given a string, find the length of the longest substring T that c ...
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 --Java,C++,Python解法
题目地址:Longest Substring with At Most Two Distinct Characters - LeetCode Given a string s , find the l ...
【算法】159题 Longest Substring with at Most Two Distinct Characters 最大的子串
1.概述给定一个字符串.查找一个最长子序列,这个子序列中重复的字符最多包含2个. 此问题和 [算法]剑指 Offer 48. 最长不含重复字符的子字符串问题很相似. 2.方案 2.1 双指针 pu ...
Leetcode每日必刷题库第3题，如何实现无重复字符的最长子串？
题目: 给定一个字符串,请你找出其中不含有重复字符的最长子串的长度. 示例: 示例 1: 输入: "abcabcbb" 输出: 3 解释: 因为无重复字符的最长子串是 &qu ...
LeetCode 340. Longest Substring with At Most K Distinct Characters
原题链接在这里:https://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters/ 题目: Give ...
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 characte ...

[LeetCode] Longest Substring with At Most K Distinct Characters 最多有K个不同字符的最长子串...

[LeetCode] Longest Substring with At Most K Distinct Characters 最多有K个不同字符的最长子串...相关推荐

最新文章

热门文章