mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 07:21:40 +08:00
update
This commit is contained in:
@@ -155,7 +155,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"7.5K\", \"totalSubmission\": \"18.5K\", \"totalAcceptedRaw\": 7502, \"totalSubmissionRaw\": 18481, \"acRate\": \"40.6%\"}",
|
||||
"stats": "{\"totalAccepted\": \"7.9K\", \"totalSubmission\": \"19.4K\", \"totalAcceptedRaw\": 7895, \"totalSubmissionRaw\": 19411, \"acRate\": \"40.7%\"}",
|
||||
"hints": [
|
||||
"试着简化这个问题:如果你只需要知道由列表中其他两个单词组成的最长单词会如何?",
|
||||
"如果只想知道由列表中其他两个单词组成的最长单词,那么可以遍历全部单词,从最长到最短,检查每个单词是否可以由其他两个单词组成。为了检查,我们可以将字符串从所有可能的位置分开。",
|
||||
|
Reference in New Issue
Block a user