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-transformer-lcci.json
View File

@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"15.1K\", \"totalSubmission\": \"37.5K\", \"totalAcceptedRaw\": 15117, \"totalSubmissionRaw\": 37511, \"acRate\": \"40.3%\"}",
"stats": "{\"totalAccepted\": \"15.1K\", \"totalSubmission\": \"37.5K\", \"totalAcceptedRaw\": 15117, \"totalSubmissionRaw\": 37516, \"acRate\": \"40.3%\"}",
"hints": [
"从一个蛮力的递归解法开始。只需要创建所有一次编辑的单词，检查它们是否在字典中，然后尝试该编辑路径。",
"一旦你有了一个蛮力解法，就可以尝试找到一个更快的方法以得到所有一次编辑的有效单词。当绝大多数字符串都不是有效的字典单词时，你不会想创建所有一次编辑的字符串。",