update

leetcode-cn/originData/smallest-k-lcci.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>设计一个算法，找出数组中最小的k个数。以任意顺序返回这k个数均可。</p>\n\n<p><strong>示例：</strong></p>\n\n<pre><strong>输入：</strong> arr = [1,3,5,7,2,4,6,8], k = 4\n<strong>输出：</strong> [1,2,3,4]\n</pre>\n\n<p><strong>提示：</strong></p>\n\n<ul>\n\t<li><code>0 &lt;= len(arr) &lt;= 100000</code></li>\n\t<li><code>0 &lt;= k &lt;= min(100000, len(arr))</code></li>\n</ul>\n",
             "isPaidOnly": false,
             "difficulty": "Medium",
-            "likes": 182,
+            "likes": 183,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[]",
@@ -161,7 +161,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"86.9K\", \"totalSubmission\": \"146K\", \"totalAcceptedRaw\": 86889, \"totalSubmissionRaw\": 146015, \"acRate\": \"59.5%\"}",
+            "stats": "{\"totalAccepted\": \"88.7K\", \"totalSubmission\": \"149.2K\", \"totalAcceptedRaw\": 88680, \"totalSubmissionRaw\": 149186, \"acRate\": \"59.4%\"}",
             "hints": [
                 "实际上有几种方法。动脑筋想一想。从简单的方法开始也没问题。",
                 "考虑以某种方式重新组织数据或者使用其他数据结构。",