mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-07 00:11:41 +08:00
update
This commit is contained in:
@@ -149,7 +149,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"20.5K\", \"totalSubmission\": \"35.3K\", \"totalAcceptedRaw\": 20504, \"totalSubmissionRaw\": 35272, \"acRate\": \"58.1%\"}",
|
||||
"stats": "{\"totalAccepted\": \"20.5K\", \"totalSubmission\": \"35.3K\", \"totalAcceptedRaw\": 20505, \"totalSubmissionRaw\": 35274, \"acRate\": \"58.1%\"}",
|
||||
"hints": [
|
||||
"让我们假设用不同的列表存储猫和狗。怎样才能找到所有物种中最老的动物呢?要有创意。",
|
||||
"可以考虑为狗和猫保留一个链表,然后遍历它找到第一只狗(或猫)。这样做的影响是什么?",
|
||||
|
Reference in New Issue
Block a user