先快速排序,再遍歷k次,由於限制在10000,所以愛咋咋
代碼:
class Solution {
public:
vector<int> getLeastNumbers(vector<int>& arr, int k) {
vector<int> ans;
sort(arr.begin(), arr.end());
for (int i = 0; i < k; i++)
ans.push_back(arr[i]);
return ans;
}
};
但是時間有點慢