update

leetcode-cn/originData/reverse-linked-list-ii.json

@@ -12,7 +12,7 @@
             "translatedContent": "给你单链表的头指针 <code>head</code> 和两个整数 <code>left</code> 和 <code>right</code> ，其中 <code>left <= right</code> 。请你反转从位置 <code>left</code> 到位置 <code>right</code> 的链表节点，返回 <strong>反转后的链表</strong> 。\n<p> </p>\n\n<p><strong>示例 1：</strong></p>\n<img alt=\"\" src=\"https://assets.leetcode.com/uploads/2021/02/19/rev2ex2.jpg\" style=\"width: 542px; height: 222px;\" />\n<pre>\n<strong>输入：</strong>head = [1,2,3,4,5], left = 2, right = 4\n<strong>输出：</strong>[1,4,3,2,5]\n</pre>\n\n<p><strong>示例 2：</strong></p>\n\n<pre>\n<strong>输入：</strong>head = [5], left = 1, right = 1\n<strong>输出：</strong>[5]\n</pre>\n\n<p> </p>\n\n<p><strong>提示：</strong></p>\n\n<ul>\n\t<li>链表中节点数目为 <code>n</code></li>\n\t<li><code>1 <= n <= 500</code></li>\n\t<li><code>-500 <= Node.val <= 500</code></li>\n\t<li><code>1 <= left <= right <= n</code></li>\n</ul>\n\n<p> </p>\n\n<p><strong>进阶：</strong> 你可以使用一趟扫描完成反转吗？</p>\n",
             "isPaidOnly": false,
             "difficulty": "Medium",
-            "likes": 1218,
+            "likes": 1248,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[{\"title\": \"Reverse Linked List\", \"titleSlug\": \"reverse-linked-list\", \"difficulty\": \"Easy\", \"translatedTitle\": \"\\u53cd\\u8f6c\\u94fe\\u8868\"}]",
@@ -137,7 +137,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"272.4K\", \"totalSubmission\": \"493K\", \"totalAcceptedRaw\": 272352, \"totalSubmissionRaw\": 492994, \"acRate\": \"55.2%\"}",
+            "stats": "{\"totalAccepted\": \"285.4K\", \"totalSubmission\": \"516.1K\", \"totalAcceptedRaw\": 285390, \"totalSubmissionRaw\": 516077, \"acRate\": \"55.3%\"}",
             "hints": [],
             "solution": null,
             "status": null,