LeetCode-40: the minimum number of k

One, Title Description

Second, problem-solving ideas

Certainly first sort, we can use the quick-sort or heap sort, and so on, or just the STL sortfunction

/*
class Solution {
public:
    vector<int> getLeastNumbers(vector<int>& arr, int k) {
        priority_queue<int, vector<int>, greater<int>> q;
        auto len = arr.size();
        for(auto i = 0; i < len; i++)
            q.push(arr[i]);
        vector<int> sln;
        for(int i = 0; i < k; i++){
            sln.push_back(q.top());
            q.pop();
        }
        return sln;
    }
};
*/
class Solution {
public:
    vector<int> getLeastNumbers(vector<int>& arr, int k) {
        sort(arr.begin(), arr.end());
        vector<int> sln;
        for(int i = 0; i < k; i++)
            sln.push_back(arr[i]);
        return sln;
    }
};

Third, the operating results

The above sortsort, heap sort below