forked from fishercoder1534/Leetcode
-
Notifications
You must be signed in to change notification settings - Fork 1
/
_1297.java
40 lines (37 loc) · 1.36 KB
/
_1297.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
package com.fishercoder.solutions;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.Set;
public class _1297 {
public static class Solution1 {
public int maxFreq(String s, int maxLetters, int minSize, int maxSize) {
int maxFreq = 0;
for (int size = minSize; size <= maxSize; size++) {
maxFreq = Math.max(maxFreq, getMaxFreqWithThisSize(s, maxLetters, size));
}
return maxFreq;
}
private int getMaxFreqWithThisSize(String str, int maxLetters, int size) {
Map<String, Integer> map = new HashMap<>();
for (int i = 0; i <= str.length() - size; i++) {
String substring = str.substring(i, i + size);
Set<Character> set = new HashSet<>();
for (int j = 0; j < substring.length(); j++) {
set.add(substring.charAt(j));
if (set.size() > maxLetters) {
break;
}
}
if (set.size() <= maxLetters) {
map.put(substring, map.getOrDefault(substring, 0) + 1);
}
}
int max = 0;
for (String key : map.keySet()) {
max = Math.max(max, map.get(key));
}
return max;
}
}
}