update

leetcode-cn/originData/vvXgSW.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>给定一个链表数组，每个链表都已经按升序排列。</p>\n\n<p>请将所有链表合并到一个升序链表中，返回合并后的链表。</p>\n\n<p>&nbsp;</p>\n\n<p><strong>示例 1：</strong></p>\n\n<pre>\n<strong>输入：</strong>lists = [[1,4,5],[1,3,4],[2,6]]\n<strong>输出：</strong>[1,1,2,3,4,4,5,6]\n<strong>解释：</strong>链表数组如下：\n[\n  1-&gt;4-&gt;5,\n  1-&gt;3-&gt;4,\n  2-&gt;6\n]\n将它们合并到一个有序链表中得到。\n1-&gt;1-&gt;2-&gt;3-&gt;4-&gt;4-&gt;5-&gt;6\n</pre>\n\n<p><strong>示例 2：</strong></p>\n\n<pre>\n<strong>输入：</strong>lists = []\n<strong>输出：</strong>[]\n</pre>\n\n<p><strong>示例 3：</strong></p>\n\n<pre>\n<strong>输入：</strong>lists = [[]]\n<strong>输出：</strong>[]\n</pre>\n\n<p>&nbsp;</p>\n\n<p><strong>提示：</strong></p>\n\n<ul>\n\t<li><code>k == lists.length</code></li>\n\t<li><code>0 &lt;= k &lt;= 10^4</code></li>\n\t<li><code>0 &lt;= lists[i].length &lt;= 500</code></li>\n\t<li><code>-10^4 &lt;= lists[i][j] &lt;= 10^4</code></li>\n\t<li><code>lists[i]</code> 按 <strong>升序</strong> 排列</li>\n\t<li><code>lists[i].length</code> 的总和不超过 <code>10^4</code></li>\n</ul>\n\n<p>&nbsp;</p>\n\n<p><meta charset=\"UTF-8\" />注意：本题与主站 23&nbsp;题相同：&nbsp;<a href=\"https://leetcode-cn.com/problems/merge-k-sorted-lists/\">https://leetcode-cn.com/problems/merge-k-sorted-lists/</a></p>\n",
             "isPaidOnly": false,
             "difficulty": "Hard",
-            "likes": 33,
+            "likes": 37,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[]",
@@ -162,7 +162,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"10K\", \"totalSubmission\": \"15.6K\", \"totalAcceptedRaw\": 9972, \"totalSubmissionRaw\": 15558, \"acRate\": \"64.1%\"}",
+            "stats": "{\"totalAccepted\": \"11.7K\", \"totalSubmission\": \"18.3K\", \"totalAcceptedRaw\": 11677, \"totalSubmissionRaw\": 18275, \"acRate\": \"63.9%\"}",
             "hints": [],
             "solution": null,
             "status": null,