mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-06 16:01:41 +08:00
update
This commit is contained in:
@@ -155,7 +155,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"67.3K\", \"totalSubmission\": \"143.8K\", \"totalAcceptedRaw\": 67268, \"totalSubmissionRaw\": 143805, \"acRate\": \"46.8%\"}",
|
||||
"stats": "{\"totalAccepted\": \"67.3K\", \"totalSubmission\": \"143.8K\", \"totalAcceptedRaw\": 67275, \"totalSubmissionRaw\": 143817, \"acRate\": \"46.8%\"}",
|
||||
"hints": [
|
||||
"当然,你可以将链表转换为整数,计算总和,然后将其转换回新的链表。如果你在面试中这样做,面试官可能会接受答案,然后看看你在不能将其转换为数字然后返回的情况下,还能否做到这一点。",
|
||||
"尝试递归。假设你有两个链表,A = 1 -> 5 -> 9(代表951)和B = 2 -> 3 -> 6 -> 7(代表7632),以及一个操作链表其余部分的函数(5 -> 9和3 -> 6 -> 7)。你能用这个来创建求和方法吗?sum(1 -> 5 -> 9, 2 -> 3 -> 6 -> 7)和sum(5 -> 9, 3 -> 6 -> 7)之间有何关系?",
|
||||
|
Reference in New Issue
Block a user