update

leetcode-cn/originData/reverse-pairs.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>给定一个数组&nbsp;<code>nums</code>&nbsp;，如果&nbsp;<code>i &lt; j</code>&nbsp;且&nbsp;<code>nums[i] &gt; 2*nums[j]</code>&nbsp;我们就将&nbsp;<code>(i, j)</code>&nbsp;称作一个<strong><em>重要翻转对</em></strong>。</p>\n\n<p>你需要返回给定数组中的重要翻转对的数量。</p>\n\n<p><strong>示例 1:</strong></p>\n\n<pre>\n<strong>输入</strong>: [1,3,2,3,1]\n<strong>输出</strong>: 2\n</pre>\n\n<p><strong>示例 2:</strong></p>\n\n<pre>\n<strong>输入</strong>: [2,4,3,5,1]\n<strong>输出</strong>: 3\n</pre>\n\n<p><strong>注意:</strong></p>\n\n<ol>\n\t<li>给定数组的长度不会超过<code>50000</code>。</li>\n\t<li>输入数组中的所有数字都在32位整数的表示范围内。</li>\n</ol>\n",
             "isPaidOnly": false,
             "difficulty": "Hard",
-            "likes": 343,
+            "likes": 349,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[{\"title\": \"Count of Smaller Numbers After Self\", \"titleSlug\": \"count-of-smaller-numbers-after-self\", \"difficulty\": \"Hard\", \"translatedTitle\": \"\\u8ba1\\u7b97\\u53f3\\u4fa7\\u5c0f\\u4e8e\\u5f53\\u524d\\u5143\\u7d20\\u7684\\u4e2a\\u6570\"}, {\"title\": \"Count of Range Sum\", \"titleSlug\": \"count-of-range-sum\", \"difficulty\": \"Hard\", \"translatedTitle\": \"\\u533a\\u95f4\\u548c\\u7684\\u4e2a\\u6570\"}]",
@@ -173,7 +173,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"29.4K\", \"totalSubmission\": \"83.9K\", \"totalAcceptedRaw\": 29444, \"totalSubmissionRaw\": 83876, \"acRate\": \"35.1%\"}",
+            "stats": "{\"totalAccepted\": \"30.2K\", \"totalSubmission\": \"85.8K\", \"totalAcceptedRaw\": 30229, \"totalSubmissionRaw\": 85772, \"acRate\": \"35.2%\"}",
             "hints": [],
             "solution": null,
             "status": null,