Leetcode #395. Longest Substring with At Least K Repeating Characters

Leetcode #395. Longest Substring with At Least K Repeating Characters

题目链接

https://leetcode.com/problems/longest-substring-with-at-least-k-repeating-characters/description/

代码

思路：首先检查当前字符串是否满足要求，如不满足，找到第一个不满足的字符第一次出现的index，递归子字符串[0, index-1]、[index + 1, end]；若满足，则返回当前字符串长度

class Solution {
public:
    int longestSubstring(string s, int k) {
        // cout << s << "===" << endl;
        if (s.length() < k) return 0;
        vector<int> rec(26);
        for (int i = 0; i < s.length(); i++) rec[s[i] - 'a']++;
        for (int i = 0; i < 26; i++) {
            if (rec[i] && rec[i] < k) {
                for (int j = 0; j < s.length(); j++) {
                    if (s[j] == 'a' + i) {
                        if (j == 0)
                            return longestSubstring(s.substr(1), k);
                        else if (j == s.length() - 1)
                            return longestSubstring(s.substr(0, j), k);
                        else 
                            return max(longestSubstring(s.substr(0, j), k), longestSubstring(s.substr(j+1), k));
                    }
                }
            }
        }
        return s.length();
    }
};