面试题40：最小的k个数

【题目】
输入n个整数，找出其中最小的k个数。例如输入4、5、1、6、2、7、3、8这8个数字，则最小的4个数字是1、2、3、4。
【code】
方法一：时间复杂度为O(n)的算法，只有当我们可以修改输入的数组时可用

#include<iostream>
//#include<vector>
#include<stack>
#include<algorithm>
//#include<stack>
#include<queue>

using namespace std;

int Partition(vector<int>& data, int start,int end)
{
	int small = start;
	for (int i = start; i < end; i++)
	{
		if (data[i]<data[end])
		{
			if (i!=small)
			{
				swap(data[i], data[small]);
			}
			small++;
		}
	}
	swap(data[end], data[small]);
	return small;
}

void getLeastNum(vector<int>& data,int k)
{
	int start = 0; int end = data.size() - 1;
	int index = Partition(data, start, end);
	while (index!=k)
	{
		if (index>k)
		{
			end = index - 1;
			index = Partition(data, start, end);
		}
		else
		{
			start = index + 1;
			index = Partition(data, start, end);
		}
	}

}

int main()
{
	vector<int> data = { 4,5,1,6,2,7,3,8 };

	int k = 4;
	getLeastNum(data, k-1);
	for (int i = 0; i < k; i++)
	{
		cout << data[i] << " ";
	}
	
	
	/*for (int i = 0; i < res.size(); i++)
	{
		cout << "{";
		int size = res[i].size()-1;
		for (int j = 0; j < size; j++)
		{
			cout << res[i][j] << ",";
		}
		if (res[i].size())
		{
			cout << res[i][res[i].size() - 1];
		}
		cout << "}" << endl;
	}*/

	return 0;
}

/****

***/

方法二：时间复杂度为O(nlogk)的算法，特别适合处理海量数据。

利用STL :: multiset 来实现

#include<iostream>
//#include<vector>
#include<stack>
#include<algorithm>
//#include<stack>
#include<queue>
#include<set>

using namespace std;
typedef multiset<int, greater<int>> int_multiset;
typedef multiset<int, greater<int>>::iterator multiset_iterator;

void getLeastNum(vector<int>& data,int k, int_multiset& res)
{
	for (int i = k; i < data.size(); i++)
	{
		multiset_iterator iter_great = res.begin();
		if (data[i]<*iter_great)
		{
			res.erase(iter_great);
			res.insert(data[i]);
		}
	}

}

int main()
{
	vector<int> data = { 4,5,1,6,2,7,3,8 };
	int_multiset res;
	int k = 4;
	for (int i = 0; i < k; i++)
	{
		res.insert(data[i]);
	}

	getLeastNum(data, k-1,res);

	multiset_iterator iter = res.end();
	iter--;
	for (; iter!=res.begin(); iter--)
	{
		cout << *iter << " ";
	}
	cout << *iter << " ";
	
	/*for (int i = 0; i < res.size(); i++)
	{
		cout << "{";
		int size = res[i].size()-1;
		for (int j = 0; j < size; j++)
		{
			cout << res[i][j] << ",";
		}
		if (res[i].size())
		{
			cout << res[i][res[i].size() - 1];
		}
		cout << "}" << endl;
	}*/

	return 0;
}

/****

***/

利用大顶堆的方式 来实现

#include<iostream>
//#include<vector>
#include<stack>
#include<algorithm>
//#include<stack>
#include<queue>
#include<set>

using namespace std;


void heapAdjust(int* res, int start,int end)
{
	int tmp = res[start];
	for (int i = start*2; i <= end; i=i*2)
	{
		if (i<end && res[i]<res[i+1])
		{
			i++;
		}
		if (res[i]<=tmp)
		{
			break;
		}
		res[start] = res[i];
		start = i;
	}
	res[start] = tmp;
}

void getLeastNum(vector<int>& data,int k, int* res)
{
	for (int i = k; i < data.size(); i++)
	{
		if (data[i]<res[1])
		{
			res[1] = data[i];
			heapAdjust(res, 1, k);
			/*for (int i = 1; i < k + 1; i++)
			{
				cout << res[i] << " ";
			}
			cout << endl;*/
		}
	}

}

int main()
{
	vector<int> data = { 4,5,1,6,2,7,3,8 };
	//int_multiset res;
	int k = 4;

	int* res = new int[k + 1];

	for (int i = 0; i < k; i++)
	{
		res[i+1]=data[i];
	}

	/*for (int i = 1; i < k + 1; i++)
	{
		cout << res[i] << " ";
	}
	cout << endl;*/

	for (int i = k/2; i >0; i--)
	{
		heapAdjust(res, i, k);
	}

	/*for (int i = 1; i < k + 1; i++)
	{
		cout << res[i] << " ";
	}
	cout << endl;*/




	getLeastNum(data, k,res);

	for (int i = 1; i < k+1; i++)
	{
		cout << res[i] << " ";
	}
	
	
	/*for (int i = 0; i < res.size(); i++)
	{
		cout << "{";
		int size = res[i].size()-1;
		for (int j = 0; j < size; j++)
		{
			cout << res[i][j] << ",";
		}
		if (res[i].size())
		{
			cout << res[i][res[i].size() - 1];
		}
		cout << "}" << endl;
	}*/

	return 0;
}

/****

***/