update

leetcode-cn/originData/partition-list.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>给你一个链表的头节点 <code>head</code> 和一个特定值<em> </em><code>x</code> ，请你对链表进行分隔，使得所有 <strong>小于</strong> <code>x</code> 的节点都出现在 <strong>大于或等于</strong> <code>x</code> 的节点之前。</p>\n\n<p>你应当 <strong>保留</strong> 两个分区中每个节点的初始相对位置。</p>\n\n<p> </p>\n\n<p><strong>示例 1：</strong></p>\n<img alt=\"\" src=\"https://assets.leetcode.com/uploads/2021/01/04/partition.jpg\" style=\"width: 662px; height: 222px;\" />\n<pre>\n<strong>输入：</strong>head = [1,4,3,2,5,2], x = 3\n<strong>输出</strong>：[1,2,2,4,3,5]\n</pre>\n\n<p><strong>示例 2：</strong></p>\n\n<pre>\n<strong>输入：</strong>head = [2,1], x = 2\n<strong>输出</strong>：[1,2]\n</pre>\n\n<p> </p>\n\n<p><strong>提示：</strong></p>\n\n<ul>\n\t<li>链表中节点的数目在范围 <code>[0, 200]</code> 内</li>\n\t<li><code>-100 <= Node.val <= 100</code></li>\n\t<li><code>-200 <= x <= 200</code></li>\n</ul>\n",
             "isPaidOnly": false,
             "difficulty": "Medium",
-            "likes": 544,
+            "likes": 545,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[]",
@@ -143,7 +143,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"142.4K\", \"totalSubmission\": \"225.1K\", \"totalAcceptedRaw\": 142371, \"totalSubmissionRaw\": 225140, \"acRate\": \"63.2%\"}",
+            "stats": "{\"totalAccepted\": \"142.7K\", \"totalSubmission\": \"225.7K\", \"totalAcceptedRaw\": 142702, \"totalSubmissionRaw\": 225661, \"acRate\": \"63.2%\"}",
             "hints": [],
             "solution": null,
             "status": null,