Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- int longestSubstring(string s, int k) {
- for (int i = 0; i < s.length(); i++) {
- if (count(s.begin(), s.end(), s[i]) < k) {
- string left = s.substr(0,i);
- string right = s.substr(i+1,s.size()-1);
- return max(longestSubstring(left,k),longestSubstring(right,k));
- }
- }
- return s.length();
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement