题解 | #最小的K个数#

class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param input int整型vector 
     * @param k int整型 
     * @return int整型vector
     */
     void quick_sort(vector<int>&nums,int l,int r){
        if(l>=r) return;
         int x = nums[(l+r)>>1],i = l-1,j = r+1;
        while(i<j){
        do i++;while(nums[i]<x);
        do j--; while(nums[j]>x);
         if(i<j)swap(nums[i],nums[j]);
        }
       quick_sort(nums,l, j);
       quick_sort(nums,j+1, r);
     }

    vector<int> GetLeastNumbers_Solution(vector<int>& input, int k) {
        // write code here
        vector<int>res;
        quick_sort(input,0, input.size()-1);

         return vector<int>{input.begin(),input.begin()+k};
        

    }
};