add 1297

Author: luliyucoordinate

README.md

@@ -594,4 +594,5 @@ LeetCode
 |1292|[Maximum Side Length of a Square with Sum Less than or Equal to Threshold](https://leetcode.com/problems/maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold/)|c|[c++](./src/1292-Maximum-Side-Length-of-a-Square-with-Sum-Less-than-or-Equal-to-Threshold/1292.cpp)|[python](./src/1292-Maximum-Side-Length-of-a-Square-with-Sum-Less-than-or-Equal-to-Threshold/1292.py)|[go](./src/1292-Maximum-Side-Length-of-a-Square-with-Sum-Less-than-or-Equal-to-Threshold/1292.go)|[js](./src/1292-Maximum-Side-Length-of-a-Square-with-Sum-Less-than-or-Equal-to-Threshold/1292.js)|[java](./src/1292-Maximum-Side-Length-of-a-Square-with-Sum-Less-than-or-Equal-to-Threshold/1292.java)|Medium|
 |1293|[Shortest Path in a Grid with Obstacles Elimination](https://leetcode.com/problems/shortest-path-in-a-grid-with-obstacles-elimination/)|c|[c++](./src/1293-Shortest-Path-in-a-Grid-with-Obstacles-Elimination/1293.cpp)|[python](./src/1293-Shortest-Path-in-a-Grid-with-Obstacles-Elimination/1293.py)|[go](./src/1293-Shortest-Path-in-a-Grid-with-Obstacles-Elimination/1293.go)|[js](./src/1293-Shortest-Path-in-a-Grid-with-Obstacles-Elimination/1293.js)|[java](./src/1293-Shortest-Path-in-a-Grid-with-Obstacles-Elimination/1293.java)|Hard|
 |1295|[Find Numbers with Even Number of Digits](https://leetcode.com/problems/find-numbers-with-even-number-of-digits/)|c|[c++](./src/1295-Find-Numbers-with-Even-Number-of-Digits/1295.cpp)|[python](./src/1295-Find-Numbers-with-Even-Number-of-Digits/1295.py)|[go](./src/1295-Find-Numbers-with-Even-Number-of-Digits/1295.go)|[js](./src/1295-Find-Numbers-with-Even-Number-of-Digits/1295.js)|[java](./src/1295-Find-Numbers-with-Even-Number-of-Digits/1295.java)|Easy|
-|1296|[Divide Array in Sets of K Consecutive Numbers](https://leetcode.com/problems/divide-array-in-sets-of-k-consecutive-numbers/)|c|[c++](./src/1296-Divide-Array-in-Sets-of-K-Consecutive-Numbers/1296.cpp)|[python](./src/1296-Divide-Array-in-Sets-of-K-Consecutive-Numbers/1296.py)|[go](./src/1296-Divide-Array-in-Sets-of-K-Consecutive-Numbers/1296.go)|[js](./src/1296-Divide-Array-in-Sets-of-K-Consecutive-Numbers/1296.js)|[java](./src/1296-Divide-Array-in-Sets-of-K-Consecutive-Numbers/1296.java)|Medium|
+|1296|[Divide Array in Sets of K Consecutive Numbers](https://leetcode.com/problems/divide-array-in-sets-of-k-consecutive-numbers/)|c|[c++](./src/1296-Divide-Array-in-Sets-of-K-Consecutive-Numbers/1296.cpp)|[python](./src/1296-Divide-Array-in-Sets-of-K-Consecutive-Numbers/1296.py)|[go](./src/1296-Divide-Array-in-Sets-of-K-Consecutive-Numbers/1296.go)|[js](./src/1296-Divide-Array-in-Sets-of-K-Consecutive-Numbers/1296.js)|[java](./src/1296-Divide-Array-in-Sets-of-K-Consecutive-Numbers/1296.java)|Medium|
+|1297|[Maximum Number of Occurrences of a Substring](https://leetcode.com/problems/maximum-number-of-occurrences-of-a-substring/)|c|[c++](./src/1297-Maximum-Number-of-Occurrences-of-a-Substring/1297.cpp)|[python](./src/1297-Maximum-Number-of-Occurrences-of-a-Substring/1297.py)|[go](./src/1297-Maximum-Number-of-Occurrences-of-a-Substring/1297.go)|[js](./src/1297-Maximum-Number-of-Occurrences-of-a-Substring/1297.js)|[java](./src/1297-Maximum-Number-of-Occurrences-of-a-Substring/1297.java)|Medium|

src/1297-Maximum-Number-of-Occurrences-of-a-Substring/1297.cpp

@@ -0,0 +1,25 @@
+class Solution 
+{
+public:
+    int maxFreq(string s, int maxLetters, int minSize, int maxSize) 
+    {
+        char chs[256] = {};
+        int nq = 0, res = 0, l = minSize;
+        unordered_map<string, int> cnt;
+        
+        for (int r = 0; r < s.size(); r++)
+        {
+            if (chs[s[r]]++ == 0) ++nq;
+            if (l <= r)
+            {
+                if (--chs[s[r - l]] == 0) --nq;
+            }
+            
+            if (l - 1 <= r && nq <= maxLetters)
+            {
+                res = max(res, ++cnt[s.substr(r - l + 1, l)]);
+            }
+        }
+        return res;
+    }
+};

src/1297-Maximum-Number-of-Occurrences-of-a-Substring/1297.go

@@ -0,0 +1,37 @@
+func maxFreq(s string, maxLetters int, minSize int, maxSize int) int {
+    cnt := make(map[string]int)
+    for i := 0; i <= len(s) - minSize; i++ {
+        cnt[s[i:i + minSize]]++
+    }
+    
+    cntStr := make(map[int][]string)
+    for k, v := range cnt {
+        cntStr[v] = append(cntStr[v], k)
+    }
+    
+    keys := make([]int, 0)
+    for k := range cntStr {
+        keys = append(keys, k)
+    }
+    sort.Ints(keys)
+    
+    for i := len(keys) - 1; i >= 0; i-- {
+        for _, str := range cntStr[keys[i]] {
+            sCnt := make(map[rune]int)
+            nq := 0
+            for _, c := range str {
+                if sCnt[c] == 0 {
+                    nq++
+                    if nq > maxLetters {
+                        break
+                    }
+                    sCnt[c]++
+                }
+            }
+            if nq <= maxLetters {
+                return keys[i]
+            }
+        }
+    }
+    return 0
+}

src/1297-Maximum-Number-of-Occurrences-of-a-Substring/1297.java

@@ -0,0 +1,23 @@
+class Solution {
+    public int maxFreq(String s, int maxLetters, int minSize, int maxSize) {
+        char[] data = s.toCharArray();
+        char[] chs = new char[256];
+        int nq = 0, res = 0, l = minSize;
+        Map<String, Integer> cnt = new HashMap();
+        
+        for (int r = 0; r < data.length; r++) {
+            if (chs[data[r]]++ == 0) ++nq;
+            if (l <= r) {
+                if (--chs[data[r - l]] == 0) nq--;
+            }
+            
+            if (l - 1 <= r && nq <= maxLetters) {
+                String curStr = s.substring(r - l + 1, r + 1);
+                int t = cnt.getOrDefault(curStr, 0) + 1;
+                cnt.put(curStr, t);
+                if (t > res) res = t;
+            }
+        }
+        return res;
+    }
+}

src/1297-Maximum-Number-of-Occurrences-of-a-Substring/1297.js

@@ -0,0 +1,20 @@
+var maxFreq = function(s, maxLetters, minSize, maxSize) {
+    let chs = new Array(256);
+    chs.fill(0);
+    let nq = res = 0, l = minSize, cnt = new Map();
+    
+    for (let r = 0; r < s.length; r++) {
+        if (chs[s.charCodeAt(r)]++ == 0) ++nq;
+        if (l <= r) {
+            if (--chs[s.charCodeAt(r - l)] == 0) --nq;
+        }
+        
+        if (l - 1 <= r && nq <= maxLetters) {
+            let curStr = s.substring(r - l + 1, r + 1);
+            let t = (cnt.get(curStr) || 0) + 1;
+            cnt.set(curStr, t);
+            if (t > res) res = t;
+        }
+    }
+    return res;
+};

src/1297-Maximum-Number-of-Occurrences-of-a-Substring/1297.py

@@ -0,0 +1,7 @@
+class Solution:
+    def maxFreq(self, s: str, maxLetters: int, minSize: int, maxSize: int) -> int:
+        cnt = collections.Counter([s[i:i + minSize] for i in range(len(s) - minSize + 1)])
+        for k, v in cnt.most_common():
+            if len(set(k)) <= maxLetters:
+                return v
+        return 0

src/addProb.py

@@ -2,9 +2,9 @@
 import os, bisect
 
 # 题目名称
-name = "Divide Array in Sets of K Consecutive Numbers"
-ID = 1296
-url = "https://leetcode.com/problems/divide-array-in-sets-of-k-consecutive-numbers/"
+name = "Maximum Number of Occurrences of a Substring"
+ID = 1297
+url = "https://leetcode.com/problems/maximum-number-of-occurrences-of-a-substring/"
 difficult = "Medium"
 prog = ['c', 'cpp', 'py', 'go', 'js', 'java']