update

leetcode-cn/originData/swap-nodes-in-pairs.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>给你一个链表，两两交换其中相邻的节点，并返回交换后链表的头节点。你必须在不修改节点内部的值的情况下完成本题（即，只能进行节点交换）。</p>\n\n<p>&nbsp;</p>\n\n<p><strong>示例 1：</strong></p>\n<img alt=\"\" src=\"https://assets.leetcode.com/uploads/2020/10/03/swap_ex1.jpg\" style=\"width: 422px; height: 222px;\" />\n<pre>\n<strong>输入：</strong>head = [1,2,3,4]\n<strong>输出：</strong>[2,1,4,3]\n</pre>\n\n<p><strong>示例 2：</strong></p>\n\n<pre>\n<strong>输入：</strong>head = []\n<strong>输出：</strong>[]\n</pre>\n\n<p><strong>示例 3：</strong></p>\n\n<pre>\n<strong>输入：</strong>head = [1]\n<strong>输出：</strong>[1]\n</pre>\n\n<p>&nbsp;</p>\n\n<p><strong>提示：</strong></p>\n\n<ul>\n\t<li>链表中节点的数目在范围 <code>[0, 100]</code> 内</li>\n\t<li><code>0 &lt;= Node.val &lt;= 100</code></li>\n</ul>\n",
             "isPaidOnly": false,
             "difficulty": "Medium",
-            "likes": 1312,
+            "likes": 1318,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[{\"title\": \"Reverse Nodes in k-Group\", \"titleSlug\": \"reverse-nodes-in-k-group\", \"difficulty\": \"Hard\", \"translatedTitle\": \"K \\u4e2a\\u4e00\\u7ec4\\u7ffb\\u8f6c\\u94fe\\u8868\"}]",
@@ -143,7 +143,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"407.5K\", \"totalSubmission\": \"576.4K\", \"totalAcceptedRaw\": 407549, \"totalSubmissionRaw\": 576404, \"acRate\": \"70.7%\"}",
+            "stats": "{\"totalAccepted\": \"409.1K\", \"totalSubmission\": \"578.6K\", \"totalAcceptedRaw\": 409099, \"totalSubmissionRaw\": 578614, \"acRate\": \"70.7%\"}",
             "hints": [],
             "solution": null,
             "status": null,