update

leetcode-cn/originData/shu-zu-zhong-de-ni-xu-dui-lcof.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>在数组中的两个数字，如果前面一个数字大于后面的数字，则这两个数字组成一个逆序对。输入一个数组，求出这个数组中的逆序对的总数。</p>\n\n<p>&nbsp;</p>\n\n<p><strong>示例 1:</strong></p>\n\n<pre><strong>输入</strong>: [7,5,6,4]\n<strong>输出</strong>: 5</pre>\n\n<p>&nbsp;</p>\n\n<p><strong>限制：</strong></p>\n\n<p><code>0 &lt;= 数组长度 &lt;= 50000</code></p>\n",
             "isPaidOnly": false,
             "difficulty": "Hard",
-            "likes": 686,
+            "likes": 688,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[]",
@@ -173,7 +173,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"131.6K\", \"totalSubmission\": \"269K\", \"totalAcceptedRaw\": 131636, \"totalSubmissionRaw\": 268971, \"acRate\": \"48.9%\"}",
+            "stats": "{\"totalAccepted\": \"132.2K\", \"totalSubmission\": \"270.1K\", \"totalAcceptedRaw\": 132215, \"totalSubmissionRaw\": 270055, \"acRate\": \"49.0%\"}",
             "hints": [],
             "solution": null,
             "status": null,