mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-06 07:51:41 +08:00
update
This commit is contained in:
@@ -12,7 +12,7 @@
|
||||
"translatedContent": "<p>给定一个头结点为 <code>head</code> 的非空单链表,返回链表的中间结点。</p>\n\n<p>如果有两个中间结点,则返回第二个中间结点。</p>\n\n<p> </p>\n\n<p><strong>示例 1:</strong></p>\n\n<pre>\n<strong>输入:</strong>[1,2,3,4,5]\n<strong>输出:</strong>此列表中的结点 3 (序列化形式:[3,4,5])\n返回的结点值为 3 。 (测评系统对该结点序列化表述是 [3,4,5])。\n注意,我们返回了一个 ListNode 类型的对象 ans,这样:\nans.val = 3, ans.next.val = 4, ans.next.next.val = 5, 以及 ans.next.next.next = NULL.\n</pre>\n\n<p><strong>示例 2:</strong></p>\n\n<pre>\n<strong>输入:</strong>[1,2,3,4,5,6]\n<strong>输出:</strong>此列表中的结点 4 (序列化形式:[4,5,6])\n由于该列表有两个中间结点,值分别为 3 和 4,我们返回第二个结点。\n</pre>\n\n<p> </p>\n\n<p><strong>提示:</strong></p>\n\n<ul>\n\t<li>给定链表的结点数介于 <code>1</code> 和 <code>100</code> 之间。</li>\n</ul>\n",
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Easy",
|
||||
"likes": 525,
|
||||
"likes": 528,
|
||||
"dislikes": 0,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[]",
|
||||
@@ -143,7 +143,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"222.7K\", \"totalSubmission\": \"315.1K\", \"totalAcceptedRaw\": 222674, \"totalSubmissionRaw\": 315133, \"acRate\": \"70.7%\"}",
|
||||
"stats": "{\"totalAccepted\": \"223.9K\", \"totalSubmission\": \"316.9K\", \"totalAcceptedRaw\": 223891, \"totalSubmissionRaw\": 316865, \"acRate\": \"70.7%\"}",
|
||||
"hints": [],
|
||||
"solution": {
|
||||
"id": "63",
|
||||
|
Reference in New Issue
Block a user