coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-07 16:31: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/count-words-obtained-after-adding-a-letter.json
View File

@@ -167,7 +167,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"5.8K\", \"totalSubmission\": \"15.7K\", \"totalAcceptedRaw\": 5764, \"totalSubmissionRaw\": 15746, \"acRate\": \"36.6%\"}",
"stats": "{\"totalAccepted\": \"5.8K\", \"totalSubmission\": \"15.7K\", \"totalAcceptedRaw\": 5766, \"totalSubmissionRaw\": 15748, \"acRate\": \"36.6%\"}",
"hints": [
"Which data structure can be used to efficiently check if a string exists in startWords?",
"After appending a letter, all letters of a string can be rearranged in any possible way. How can we use this to reduce our search space while checking if a string in targetWords can be obtained from a string in startWords?"