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 only) such that every character in T appears no less than k times.Example 1:Input:
s = "aaabb", k = 3Output:
3The longest substring is "aaa", as 'a' is repeated 3 times.
Example 2:Input:
s = "ababbc", k = 2Output:
5The longest substring is "ababb", as 'a' is repeated 2 times and 'b' is repeated 3 times.

找出字符串中的最长子字符串，满足该子字符串中任何字符出现的次数都大于k。

思路和代码

这是一个经典的分治法解决的问题，关键在于我们如何将这个问题分解为更小的子问题。反过来想，这个子字符串一定不包含什么元素呢？当一个元素出现的总次数小于k，那么该元素一定不在子字符串中，只需要将其作为分界点，分别找出左半部分和右半部分的满足条件的最长子字符串。

    public int longestSubstring(String s, int k) {return longestSubstring(s, k, 0, s.length()-1);}public int longestSubstring(String s, int k, int left, int right) {if(left > right) {return 0;}int[] count = new int[26];for(int i = left ; i<=right ; i++) {count[s.charAt(i) - 'a']++;}int result = right - left + 1;for(int i = left ; i<=right ; i++) {if(count[s.charAt(i)-'a'] < k && count[s.charAt(i)-'a'] > 0) {int leftLongest = longestSubstring(s, k, left, i-1);int rightLongest = longestSubstring(s, k, i+1, right);result = Math.max(leftLongest, rightLongest);break;}}return result;}

395. Longest Substring with At Least K Repeating Characters相关推荐

leetcode 395. Longest Substring with At Least K Repeating Characters| 395. 至少有 K 个重复字符的最长子串（分治法）
题目 https://leetcode.com/problems/longest-substring-with-at-least-k-repeating-characters/ 题解参考:官方题解 ...
LeetCode Longest Substring with At Least K Repeating Characters(递归)
问题:给出一个字符串s,要求求出最长的子串,每个字符出现至少k次思路: 方法一,先统计每个字符出现的次数,然后分别从头和尾找出出现资料最小为k的位置,然后再此区间遍历,当出现小于k次时,在两个子区间 ...
LeetCode 340. Longest Substring with At Most K Distinct Characters
原题链接在这里:https://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters/ 题目: Give ...
[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 ...
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 ...
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 ...

395. Longest Substring with At Least K Repeating Characters

题目要求

思路和代码

395. Longest Substring with At Least K Repeating Characters相关推荐

最新文章

热门文章