update

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

@@ -12,7 +12,7 @@
             "translatedContent": "<p>给定一个非空整数数组，找到使所有数组元素相等所需的最小移动数，其中每次移动可将选定的一个元素加1或减1。 您可以假设数组的长度最多为10000。</p>\n\n<p><strong>例如:</strong></p>\n\n<pre>\n<strong>输入:</strong>\n[1,2,3]\n\n<strong>输出:</strong>\n2\n\n<strong>说明：\n</strong>只有两个动作是必要的（记得每一步仅可使其中一个元素加1或减1）： \n\n[1,2,3]  =&gt;  [2,2,3]  =&gt;  [2,2,2]\n</pre>\n",
             "isPaidOnly": false,
             "difficulty": "Medium",
-            "likes": 155,
+            "likes": 158,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[{\"title\": \"Best Meeting Point\", \"titleSlug\": \"best-meeting-point\", \"difficulty\": \"Hard\", \"translatedTitle\": \"\\u6700\\u4f73\\u7684\\u78b0\\u5934\\u5730\\u70b9\"}, {\"title\": \"Minimum Moves to Equal Array Elements\", \"titleSlug\": \"minimum-moves-to-equal-array-elements\", \"difficulty\": \"Easy\", \"translatedTitle\": \"\\u6700\\u5c0f\\u64cd\\u4f5c\\u6b21\\u6570\\u4f7f\\u6570\\u7ec4\\u5143\\u7d20\\u76f8\\u7b49\"}]",
@@ -149,7 +149,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"17.2K\", \"totalSubmission\": \"28K\", \"totalAcceptedRaw\": 17180, \"totalSubmissionRaw\": 28007, \"acRate\": \"61.3%\"}",
+            "stats": "{\"totalAccepted\": \"17.7K\", \"totalSubmission\": \"28.8K\", \"totalAcceptedRaw\": 17683, \"totalSubmissionRaw\": 28773, \"acRate\": \"61.5%\"}",
             "hints": [],
             "solution": null,
             "status": null,