update

leetcode-cn/originData/minimum-moves-to-equal-array-elements.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>给你一个长度为 <code>n</code> 的整数数组，每次操作将会使 <code>n - 1</code> 个元素增加 <code>1</code> 。返回让数组所有元素相等的最小操作次数。</p>\n\n<p>&nbsp;</p>\n\n<p><strong>示例 1：</strong></p>\n\n<pre>\n<strong>输入：</strong>nums = [1,2,3]\n<strong>输出：</strong>3\n<strong>解释：</strong>\n只需要3次操作（注意每次操作会增加两个元素的值）：\n[1,2,3]  =&gt;  [2,3,3]  =&gt;  [3,4,3]  =&gt;  [4,4,4]\n</pre>\n\n<p><strong>示例 2：</strong></p>\n\n<pre>\n<strong>输入：</strong>nums = [1,1,1]\n<strong>输出：</strong>0\n</pre>\n\n<p>&nbsp;</p>\n\n<p><strong>提示：</strong></p>\n\n<ul>\n\t<li><code>n == nums.length</code></li>\n\t<li><code>1 &lt;= nums.length &lt;= 10<sup>5</sup></code></li>\n\t<li><code>-10<sup>9</sup> &lt;= nums[i] &lt;= 10<sup>9</sup></code></li>\n\t<li>答案保证符合 <strong>32-bit</strong> 整数</li>\n</ul>\n",
             "isPaidOnly": false,
             "difficulty": "Easy",
-            "likes": 441,
+            "likes": 442,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[{\"title\": \"Minimum Moves to Equal Array Elements II\", \"titleSlug\": \"minimum-moves-to-equal-array-elements-ii\", \"difficulty\": \"Medium\", \"translatedTitle\": \"\\u6700\\u5c11\\u79fb\\u52a8\\u6b21\\u6570\\u4f7f\\u6570\\u7ec4\\u5143\\u7d20\\u76f8\\u7b49 II\"}]",
@@ -143,7 +143,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"61.3K\", \"totalSubmission\": \"100.1K\", \"totalAcceptedRaw\": 61327, \"totalSubmissionRaw\": 100132, \"acRate\": \"61.2%\"}",
+            "stats": "{\"totalAccepted\": \"61.4K\", \"totalSubmission\": \"100.3K\", \"totalAcceptedRaw\": 61417, \"totalSubmissionRaw\": 100282, \"acRate\": \"61.2%\"}",
             "hints": [],
             "solution": null,
             "status": null,