leetcode395 Longest Substring with At Least K Repeating Characters

思路:

尺取法。

循环i:1~26,分别计算恰好包含i种字母并且每种字母出现的次数大于等于k个的最长子串长度。

没法直接使用尺取法,因为不满足区间单调性,但是使用如上的方法却是可以的,因为子串中包含的字母种类数是满足区间单调性的。

实现:

 1 #include <bits/stdc++.h>
 2 using namespace std;
 3 class Solution
 4 {
 5 public:
 6     int longestSubstring(string s, int k)
 7     {
 8         int n = s.length();
 9         if (k == 1) return n;
10         int ans = 0;
11         vector<int> num(26, 0);
12         for (int i = 1; i <= 26; i++)
13         {
14             fill(num.begin(), num.end(), 0);
15             int slow = 0, fast = 0, cnt = 0;
16             set<char> st;
17             while (fast < n)
18             {
19                 while (fast < n)
20                 {
21                     if (num[s[fast] - ‘a‘] == 0) cnt++;
22                     num[s[fast] - ‘a‘]++;
23                     st.insert(s[fast]);
24                     fast++;
25                     if (cnt == i && fast < n && num[s[fast] - ‘a‘] == 0)
26                         break;
27                 }
28                 bool flg = true;
29                 for (auto it: st)
30                     if (num[it - ‘a‘] < k) { flg = false; break; }
31                 if (flg) ans = max(ans, fast - slow);
32                 if (fast == n) break;
33                 while (slow < fast && cnt == i)
34                 {
35                     num[s[slow] - ‘a‘]--;
36                     if (num[s[slow] - ‘a‘] == 0) { cnt--; st.erase(s[slow]); }
37                     slow++;
38                 }
39             }
40         }
41         return ans;
42     }
43 };
44 int main()
45 {
46     string s = "aabbccdcccde"; int k = 2;
47     cout << Solution().longestSubstring(s, k) << endl;
48     return 0;
49 }

原文地址:https://www.cnblogs.com/wangyiming/p/9614954.html

时间: 2024-08-26 02:43:22

leetcode395 Longest Substring with At Least K Repeating Characters的相关文章

LeetCode 395. Longest Substring with At Least K Repeating Characters C#

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 = 3 Output: 3 The longest substring is "aaa"

Leetcode: 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 = 3 Output: 3 The longest substring is "aaa"

[LeetCode] Longest Substring with At Least K Repeating Characters 至少有K个重复字符的最长子字符串

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 = 3 Output: 3 The longest substring is "aaa"

LeetCode 395. Longest Substring with At Least K Repeating Characters

原题链接在这里:https://leetcode.com/problems/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 

395. Longest Substring with At Least K Repeating Characters

https://leetcode.com/problems/longest-substring-with-at-least-k-repeating-characters/discuss/87739/Java-Strict-O(N)-Two-Pointer-Solution window分别为1-26个unique的字母,找出为这个长度的字母的 其中至少有K repeating ones的最长子序列,取最大值 1 class Solution { 2 public int longestSubst

395 Longest Substring with At Least K Repeating Characters 至少有K个重复字符的最长子串

找到给定字符串(由小写字符组成)中的最长子串 T , 要求 T 中的每一字符出现次数都不少于 k .输出 T 的长度.示例 1:输入:s = "aaabb", k = 3输出:3最长子串为 "aaa" ,其中 'a' 重复了 3 次.示例 2:输入:s = "ababbc", k = 2输出:5最长子串为 "ababb" ,其中 'a' 重复了 2 次, 'b' 重复了 3 次. 详见:https://leetcode.com

340. Longest Substring with At Most K Distinct Characters

/* * 340. Longest Substring with At Most K Distinct Characters * 2016-7-10 by Mingyang * 利用HashMap来做sliding window的做法非常好! */ public int lengthOfLongestSubstringKDistinct(String s, int k) { Map<Character, Integer> map = new HashMap<>(); int lef

[LeetCode] 340. 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. 159. Longest Substring with At Most Two Distinct Characters 的拓展,1

LeetCode &quot;Longest Substring with At Most K Distinct Characters&quot;

A simple variation to "Longest Substring with At Most Two Distinct Characters". A typical sliding window problem. class Solution { public: int lengthOfLongestSubstringKDistinct(string s, int k) { unordered_map<char, unsigned> hm; int ret =