TopK问题:从Quick Sort到Quick Select
写这篇文章的目的也是为了巩固下基础。TopK问题链接:
https://leetcode-cn.com/problems/zui-xiao-de-kge-shu-lcof/
从一组数中找到最小的k个数(数组不为0、0 <= k < =size)
方法一,STL自带sort函数
class Solution {
public:
vector<int> getLeastNumbers(vector<int>& arr, int k) {
sort(arr.begin(), arr.end());
arr.assign(arr.begin(), arr.begin() + k)