30. 最小的K个数(C++版本)

1. 基于Partition的方法：

int Partition(int* pData, int begin, int end)
{
	int pivot = pData[begin]; // 以第一个元素作为基准值
	int left = begin;
	int right = end;

	while (left < right)
	{
		while (left < right && pData[right] >= pivot) --right;  // 从右往左找第一个小于pivot的元素
		while (left < right && pData[left] <= pivot) ++left; // 从左往右找以一个大于privot的的元素
		if (left < right) std::swap(pData[left], pData[right]);
	}

	if (begin != left) std::swap(pData[begin], pData[left]); //  如果右边的元素都大于等于pivot会出现right = left = begin

	return left;
}

void GetLeastLessKData(int* pData, int size, int count, int* pDestData)
{
	int begin = 0;
	int end = size - 1;
	int destIdx = count - 1;

	int curIdx = Partition(pData, begin, end);
	while (curIdx != destIdx)
	{
		if (curIdx < destIdx) curIdx = Partition(pData, curIdx + 1, end);
		else curIdx = Partition(pData, begin, curIdx - 1);
	}

	for (int idx = 0; idx < count; ++idx) pDestData[idx] = pData[idx];
}

void GetLeastLessKData(int* pData, int size, int count)
{
	if (nullptr == pData || size < 1 || count < 1 || count > size) return;
	
	int* pDestData = new int[count];
	GetLeastLessKData(pData, size, count, pDestData);
	
	for (int idx = 0; idx < count; ++idx) std::cout << pData[idx] << " ";
	std::cout << std::endl;

	delete pDestData;
}

2. 基于最大堆的方法:

void GetLeastLessKData(int* pData, int size, int count)
{
	if (nullptr == pData || size < 1 || count < 1 || count > size) return;
	
	int* pDestData = new int[count];
	// 先填充pDestData
	for (int idx = 0; idx < count; ++idx) pDestData[idx] = pData[idx];
	for (int idx = count; idx < size; ++idx)
	{
		// 堆化为大根堆，make_heap后最前面的pDestData[0]为最大值, 算法头文件为<Algorithm>
		std::make_heap(pDestData, pDestData + count); 
		if (pData[idx] < pDestData[0]) pDestData[0] = pData[idx];
	}

	for (int idx = 0; idx < count; ++idx) std::cout << pDestData[idx] << " ";
	std::cout << std::endl;

	delete pDestData;
}