leetcode395

分治法。

public class Solution
    {
        private int LongestSubstringSub(string s, int k, int start, int end)
        {
            if (start > end)
            {
                return ;
            }
            int[] count = new int[];
            for (int i = start; i <= end; i++)
            {
                count[s[i] - 'a']++;
            }

            for (int i = ; i < ; i++)
            {
                if (count[i] >  && count[i] < k)
                {
                    var pos = s.IndexOf((char)(i + 'a'), start);
                    return Math.Max(LongestSubstringSub(s, k, start, pos - ), LongestSubstringSub(s, k, pos + , end));
                }
            }

            return end - start + ;
        }

        public int LongestSubstring(string s, int k)
        {
            return LongestSubstringSub(s, k, , s.Length - );
        }
    }