题解 | #最小的K个数#

一、排序直接输出

class Solution {
public:
    vector<int> GetLeastNumbers_Solution(vector<int> input, int k) {
        sort(input.begin(), input.end());
        vector<int> ans;
        for(int i = 0; i < k; i++){
            ans.push_back(input[i]);
        }
        return ans;
    }
};