|
5 | 5 | importjava.util.Map; |
6 | 6 | importjava.util.Set; |
7 | 7 |
|
8 | | -/** |
9 | | - * 1297. Maximum Number of Occurrences of a Substring |
10 | | - * |
11 | | - * Given a string s, return the maximum number of ocurrences of any substring under the following rules: |
12 | | - * |
13 | | - * The number of unique characters in the substring must be less than or equal to maxLetters. |
14 | | - * The substring size must be between minSize and maxSize inclusive. |
15 | | - * |
16 | | - * Example 1: |
17 | | - * Input: s = "aababcaab", maxLetters = 2, minSize = 3, maxSize = 4 |
18 | | - * Output: 2 |
19 | | - * Explanation: Substring "aab" has 2 ocurrences in the original string. |
20 | | - * It satisfies the conditions, 2 unique letters and size 3 (between minSize and maxSize). |
21 | | - * |
22 | | - * Example 2: |
23 | | - * Input: s = "aaaa", maxLetters = 1, minSize = 3, maxSize = 3 |
24 | | - * Output: 2 |
25 | | - * Explanation: Substring "aaa" occur 2 times in the string. It can overlap. |
26 | | - * |
27 | | - * Example 3: |
28 | | - * Input: s = "aabcabcab", maxLetters = 2, minSize = 2, maxSize = 3 |
29 | | - * Output: 3 |
30 | | - * |
31 | | - * Example 4: |
32 | | - * Input: s = "abcde", maxLetters = 2, minSize = 3, maxSize = 3 |
33 | | - * Output: 0 |
34 | | - * |
35 | | - * Constraints: |
36 | | - * 1 <= s.length <= 10^5 |
37 | | - * 1 <= maxLetters <= 26 |
38 | | - * 1 <= minSize <= maxSize <= min(26, s.length) |
39 | | - * s only contains lowercase English letters. |
40 | | - * */ |
41 | 8 | publicclass_1297 { |
42 | 9 | publicstaticclassSolution1 { |
43 | 10 | publicintmaxFreq(Strings,intmaxLetters,intminSize,intmaxSize) { |
|