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

update

Browse Source
This commit is contained in:
小墨
2022-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -40,7 +40,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"29.1K\", \"totalSubmission\": \"39K\", \"totalAcceptedRaw\": 29120, \"totalSubmissionRaw\": 38958, \"acRate\": \"74.7%\"}",
"stats": "{\"totalAccepted\": \"29.1K\", \"totalSubmission\": \"39K\", \"totalAcceptedRaw\": 29145, \"totalSubmissionRaw\": 38997, \"acRate\": \"74.7%\"}",
"hints": [
"How to check efficiently each K-length substring?",
"First store the first leftmost K-length substring in a hashTable or array of frequencies.",