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:
小墨
2023-12-09 19:57:46 +08:00
parent 9bc4722a45
commit 3770b44d1e
4792 changed files with 10889 additions and 10886 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\": \"11K\", \"totalSubmission\": \"15.7K\", \"totalAcceptedRaw\": 10977, \"totalSubmissionRaw\": 15657, \"acRate\": \"70.1%\"}",
"stats": "{\"totalAccepted\": \"11K\", \"totalSubmission\": \"15.7K\", \"totalAcceptedRaw\": 10979, \"totalSubmissionRaw\": 15662, \"acRate\": \"70.1%\"}",
"hints": [
"How to check efficiently each K-length substring?",
"First store the first leftmost K-length substring in a hashTable or array of frequencies.",