1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-02 14:12:17 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
This commit is contained in:
2022-03-29 16:56:27 +08:00
parent e730aa6794
commit ad15da05aa
2517 changed files with 7358 additions and 7332 deletions

View File

@@ -12,7 +12,7 @@
"translatedContent": "<p>输入整数数组 <code>arr</code> ,找出其中最小的 <code>k</code> 个数。例如输入4、5、1、6、2、7、3、8这8个数字则最小的4个数字是1、2、3、4。</p>\n\n<p>&nbsp;</p>\n\n<p><strong>示例 1</strong></p>\n\n<pre><strong>输入:</strong>arr = [3,2,1], k = 2\n<strong>输出:</strong>[1,2] 或者 [2,1]\n</pre>\n\n<p><strong>示例 2</strong></p>\n\n<pre><strong>输入:</strong>arr = [0,1,2,1], k = 1\n<strong>输出:</strong>[0]</pre>\n\n<p>&nbsp;</p>\n\n<p><strong>限制:</strong></p>\n\n<ul>\n\t<li><code>0 &lt;= k &lt;= arr.length &lt;= 10000</code></li>\n\t<li><code>0 &lt;= arr[i]&nbsp;&lt;= 10000</code></li>\n</ul>\n",
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 403,
"likes": 406,
"dislikes": 0,
"isLiked": null,
"similarQuestions": "[]",
@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"315.5K\", \"totalSubmission\": \"551K\", \"totalAcceptedRaw\": 315474, \"totalSubmissionRaw\": 550973, \"acRate\": \"57.3%\"}",
"stats": "{\"totalAccepted\": \"316.7K\", \"totalSubmission\": \"552.9K\", \"totalAcceptedRaw\": 316686, \"totalSubmissionRaw\": 552908, \"acRate\": \"57.3%\"}",
"hints": [],
"solution": null,
"status": null,