最小的k个数字

题目：输入n个整数，找出其中最小的k个数。例如输入4、5、1、6、2、7、3、8这8个数字，则最小的4个数字是1、2、3、4。

方法一：根据数组特点找出时间复杂度为O(n)的算法

#include<iostream>
#include<algorithm>
using namespace std;

int RandomOfRange(int start, int end);
int Partition(int* numbers, int length, int start, int end);
void Swap(int* a, int* b);
//基于Partition函数：当数组的第K个数字左边的数字都小于该第K个数字
//则打印前K个数字；否则继续调用Partition函数对数组进行排列
void GetLeastNumbers(int* numbers, int length, int k)
{
	if (numbers == nullptr || length <= 0 || k > length || k <= 0)
		return;
	int start = 0;
	int end = length - 1;
	int index = Partition(numbers, length, start, end);
	if (index != k - 1)
	{
		if (index > k - 1)
		{
			end = index - 1;
			index = Partition(numbers, length, start, end);
		}
		else
		{
			start = index + 1;
			index = Partition(numbers, length, start, end);
		}
	}
	for (int i = 0;i < k;++i)
		cout << numbers[i] << " ";
	cout << endl;
}
//对数组进行排列
int Partition(int* numbers, int length, int start, int end)
{
	if (numbers == nullptr || length <= 0 || start < 0 || end >= length)
		throw new std::exception("Invalid Parameters");
	int index = RandomOfRange(start, end);
	int small = start - 1;
	Swap(&numbers[index], &numbers[end]);
	for (index = start;index < end;++index)
	{
		if (numbers[index] < numbers[end])
		{
			++small;
			if (small != index)
				Swap(&numbers[small], &numbers[index]);
		}
	}
	++small;
	Swap(&numbers[small], &numbers[end]);
	return small;
}
//随机返回一个在范围内的数
int RandomOfRange(int start, int end)
{
	if (start < 0 || end < 0)
		throw new std::exception("Invalid Input");
	if (start == end)
		return start;
	else if (start < end)
		return rand() % (end - start + 1) + start;
	else
		return rand() % (start - end + 1) + end;
}
//交换两数
void Swap(int* a, int* b)
{
	int temp = *a;
	*a = *b;
	*b = temp;
}
//测试输入

void Test1()
{
	int numbers[] = { 1, 2, 3, 2, 2, 2, 5, 4, 2 };
	GetLeastNumbers(numbers, sizeof(numbers) / sizeof(numbers[0]), 4);
}

// 不存在出现次数超过数组长度一半的数字
void Test2()
{
	int numbers[] = { 1, 2, 3, 2, 4, 2, 5, 2, 3 };
	GetLeastNumbers(numbers, sizeof(numbers) / sizeof(numbers[0]), 4);
}

// 出现次数超过数组长度一半的数字都出现在数组的前半部分
void Test3()
{
	int numbers[] = { 2, 2, 2, 2, 2, 1, 3, 4, 5 };
	GetLeastNumbers(numbers, sizeof(numbers) / sizeof(numbers[0]), 4);
}
// 出现次数超过数组长度一半的数字都出现在数组的后半部分
void Test4()
{
	int numbers[] = { 1, 3, 4, 5, 2, 2, 2, 2, 2 };
	GetLeastNumbers(numbers, sizeof(numbers) / sizeof(numbers[0]), 4);
}

// 输入空指针
void Test5()
{
	GetLeastNumbers(nullptr, 0, 0);
}

int main(int argc, char* argv[])
{
	Test1();
	Test2();
	Test3();
	Test4();
	Test5();
	
	return 0;
}

方法二：基于红黑树的multiset实现，时间复杂度为O(nlogk),适合处理海量数据

#include<iostream>
#include<algorithm>
#include<vector>
#include <set>
#include <functional>
using namespace std;
//定义从大到小排序的intSet和对应的迭代器setIterator
typedef multiset<int, greater<int>> intSet;
typedef multiset<int, greater<int>>::iterator setIterator;

void GetLeastNumbers(const vector<int>& data, intSet& LeastNumbers, int k)
{
//清空
	LeastNumbers.clear();         
//当k<1或者k>数据的个数时返回
	if (k < 1 || data.size() < k)
		return;
//定义一个迭代器指向数据首个数字
	vector<int>::const_iterator iter = data.begin();
//遍历data
	for (;iter != data.end();++iter)
	{
//当LeastNumbers还没满时，将data中的数据按从大到小放入
		if (LeastNumbers.size() < k)
			LeastNumbers.insert(*iter);
		else
		{
//当LeastNumbers已满时，比较它的首位数字和当前data中的数字，
//若当前data中的数字小于LeastNumbers的首个数字时，删除LeastNumbers首位数字
//并把当前data中的数字按从大到小的顺序插入
			setIterator iterGreast = LeastNumbers.begin();
			if (*iter < *(LeastNumbers.begin()))
			{
				LeastNumbers.erase(*iterGreast);
				LeastNumbers.insert(*iter);
			}
		}
	}
}
//输入测试
void Test1()
{
	vector<int> data = { 4,5,6,7,1,2,3,4 };
	intSet LeastNumbers;
	GetLeastNumbers(data, LeastNumbers, 4);
	for (auto iter = LeastNumbers.begin();iter != LeastNumbers.end();++iter)
		cout << *iter << " ";
	cout << endl;
}


void Test2()
{
	vector<int> data = { 4,5,6,7,1,2,3,4 };
	intSet LeastNumbers;
	GetLeastNumbers(data, LeastNumbers, 4);
	for (auto iter = LeastNumbers.begin();iter != LeastNumbers.end();++iter)
		cout << *iter << " ";
	cout << endl;
}


void Test3()
{
	vector<int> data = { 4,4,4,1,2,3,4,4 };
	intSet LeastNumbers;
	GetLeastNumbers(data, LeastNumbers, 8);
	for (auto iter = LeastNumbers.begin();iter != LeastNumbers.end();++iter)
		cout << *iter << " ";
	cout << endl;
}

void Test4()
{
	vector<int> data = { 4,5,6,7,1,2,3,4 };
	intSet LeastNumbers;
	GetLeastNumbers(data, LeastNumbers, 0);
	for (auto iter = LeastNumbers.begin();iter != LeastNumbers.end();++iter)
		cout << *iter << " ";
	cout << endl;
}

void Test5()
{
	vector<int> data = { 4,5,6,7,1,2,3,4 };
	intSet LeastNumbers;
	GetLeastNumbers(data, LeastNumbers, 9);
	for (auto iter = LeastNumbers.begin();iter != LeastNumbers.end();++iter)
		cout << *iter << " ";
	cout << endl;
}

int main(int argc, char* argv[])
{
	Test1();
	Test2();
	Test3();
	Test4();
	Test5();
	
	return 0;
}