查找最大或最小k个数问题的不同解法

题目：设计一个算法，找出数组中最小的k个数。以任意顺序返回这k个数均可。
1.堆排序的借助优先队列，与手写堆的写法：

//借助优先队列
class Solution {
public:
    vector<int> smallestK(vector<int>& arr, int k) {
        priority_queue<int, vector<int>, mycmp> pque; 
        for (int i = 0; i < arr.size(); i++) {
            pque.push(arr[i]);
        }
        for (int i = 0; i < k; i++) {
            res.push_back(pque.top());
            pque.pop();
        }
        return res;
    }
private:
    vector<int> res;
    class mycmp{
    public:
        bool operator() (int &i1, int &i2) {
            return i1 > i2;
        }
    };
};
//手写堆
class Solution {
public:
    vector<int> smallestK(vector<int>& arr, int k) {
        for (int i = (arr.size() >> 1) - 1; i >= 0; i--) {
            heapify(arr, i, arr.size());
        }
        for (int i = arr.size() - 1; i >= 0; i--) {
            if (res.size() == k) return res;
            res.push_back(arr[0]);
            swap(arr[0], arr[i]);
            heapify(arr, 0, i);
        }
        return res;
    }
private:
    vector<int> res;
    void heapify(vector<int> &arr, int far, int size) {
        if (far >= size) return;
        int c1 = 2 * far + 1, c2 = 2 * far + 2;
        int min = far;
        if (c1 < size && arr[c1] < arr[min]) {
            min = c1;
        }
        if (c2 < size && arr[c2] < arr[min]) {
            min = c2;
        }
        if (min != far) {
            swap(arr[min], arr[far]);
            heapify(arr, min, size);
        }
    }
};

1.快速排序的借助sort，与手写快排的写法：

//借助sort
class Solution {
public:
    vector<int> smallestK(vector<int>& arr, int k) {
        sort(arr.begin(), arr.end());//默认从小到大
        vector<int> res;
        for (int i = 0; i < k; i++) {
            res.push_back(arr[i]);
        }
        return res;
    }
};
//手写快排
class Solution {
public:
    vector<int> smallestK(vector<int>& arr, int k) {
        quickSort(arr, 0, arr.size() - 1, k);
        vector<int> res;
        for (int i = 0; i < k; i++) {
            res.push_back(arr[i]);
        }
        return res;
    }
private:
    void quickSort(vector<int>&arr, int left, int right, const int &k) {
        if (left >= right) return;
        int i = left, j = right, cmp = arr[left];
        while (i < j) {
            while (i < j && arr[j] >= cmp) {
                j--;
            }
            while (i < j && arr[i] <= cmp) {
                i++;
            }
            if (i < j) {
                swap(arr[i], arr[j]);
            }
        }
        swap(arr[left], arr[i]);
        quickSort(arr, left, i - 1, k);
        quickSort(arr, i + 1, right, k);
    }
};