coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-06 07:51:41 +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/word-search-ii.json
View File

@@ -167,7 +167,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"98.4K\", \"totalSubmission\": \"226.3K\", \"totalAcceptedRaw\": 98404, \"totalSubmissionRaw\": 226281, \"acRate\": \"43.5%\"}",
"stats": "{\"totalAccepted\": \"98.4K\", \"totalSubmission\": \"226.3K\", \"totalAcceptedRaw\": 98419, \"totalSubmissionRaw\": 226326, \"acRate\": \"43.5%\"}",
"hints": [
"You would need to optimize your backtracking to pass the larger test. Could you stop backtracking earlier?",
"If the current candidate does not exist in all words&#39; prefix, you could stop backtracking immediately. What kind of data structure could answer such query efficiently? Does a hash table work? Why or why not? How about a Trie? If you would like to learn how to implement a basic trie, please work on this problem: <a href=\"https://leetcode.com/problems/implement-trie-prefix-tree/\">Implement Trie (Prefix Tree)</a> first."