剑指offer——面试题30：最小的k个数
本文共 1272 字，大约阅读时间需要 4 分钟。
void GetLeastNumbers_Solution1(int* input, int n, int* output, int k){ if(input == NULL || output == NULL || k > n || n <= 0 || k <= 0) return; int start = 0; int end = n - 1; int index = Partition(input, n, start, end); while(index != k - 1) { if(index > k - 1) { end = index - 1; index = Partition(input, n, start, end); } else { start = index + 1; index = Partition(input, n, start, end); } } for(int i = 0; i < k; ++i) output[i] = input[i];} 
typedef multiset