coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-08 00:41: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/longest-word-lcci.json
View File

@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"12.3K\", \"totalSubmission\": \"30.1K\", \"totalAcceptedRaw\": 12308, \"totalSubmissionRaw\": 30095, \"acRate\": \"40.9%\"}",
"stats": "{\"totalAccepted\": \"12.3K\", \"totalSubmission\": \"30.1K\", \"totalAcceptedRaw\": 12309, \"totalSubmissionRaw\": 30096, \"acRate\": \"40.9%\"}",
"hints": [
"试着简化这个问题：如果你只需要知道由列表中其他两个单词组成的最长单词会如何？",
"如果只想知道由列表中其他两个单词组成的最长单词，那么可以遍历全部单词，从最长到最短，检查每个单词是否可以由其他两个单词组成。为了检查，我们可以将字符串从所有可能的位置分开。",