题解 | #最小的K个数#
https://www.nowcoder.com/practice/6a296eb82cf844ca8539b57c23e6e9bf
class Solution { public: vector<int> GetLeastNumbers_Solution(vector<int> input, int k) { if(k==0 || k > input.size()) return vector<int>(); sort(input.begin(), input.end()); return vector<int>(input.begin(), input.begin()+k); } };