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

update

Browse Source
This commit is contained in:
小墨
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode-cn/originData/[no content]find-k-length-substrings-with-no-repeated-characters.json
View File

@@ -40,7 +40,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"6.5K\", \"totalSubmission\": \"9.2K\", \"totalAcceptedRaw\": 6498, \"totalSubmissionRaw\": 9218, \"acRate\": \"70.5%\"}",
"stats": "{\"totalAccepted\": \"6.7K\", \"totalSubmission\": \"9.6K\", \"totalAcceptedRaw\": 6748, \"totalSubmissionRaw\": 9573, \"acRate\": \"70.5%\"}",
"hints": [
"How to check efficiently each K-length substring?",
"First store the first leftmost K-length substring in a hashTable or array of frequencies.",