题解 | #最小的K个数#

class Solution {
  public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     *
     * @param input int整型vector
     * @param k int整型
     * @return int整型vector
     */
    vector<int> GetLeastNumbers_Solution(vector<int>& input, int k) {
        vector<int> res;
        if (k == 0) return res;
        else if (k == input.size()) return input;
        else {
            int elem = input.back();
            input.pop_back();

            res = GetLeastNumbers_Solution(input, k);
            
            sort(res.begin(), res.end());
            for (int i = 0; i < res.size(); i++) {
                if (res[i] > elem) {
                    res.insert(res.begin() + i, elem);
                    res.pop_back();
                    break;
                }
            }
            
        }

        return res;
    }
};