coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 07:21:40 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

存量题库数据更新

Browse Source
This commit is contained in:
小墨
2023-12-09 18:42:21 +08:00
parent a788808cd7
commit c198538f10
10843 changed files with 288489 additions and 248355 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode-cn/originData/count-complete-substrings.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"2.9K\", \"totalSubmission\": \"9K\", \"totalAcceptedRaw\": 2899, \"totalSubmissionRaw\": 8985, \"acRate\": \"32.3%\"}",
"stats": "{\"totalAccepted\": \"2.9K\", \"totalSubmission\": \"9K\", \"totalAcceptedRaw\": 2917, \"totalSubmissionRaw\": 9026, \"acRate\": \"32.3%\"}",
"hints": [
"There are at most 26 different lengths of the complete substrings: <code>k *1, k * 2, … k * 26</code>.****",
"For each length, we can use sliding window to count the frequency of each letter in the window.",