题目:输入n个整数,输出其中最小的k个。
例如输入1,2,3,4,5,6,7和8这8个数字,则最小的4个数字为1,2,3和4。
分析:这道题最简单的思路莫过于把输入的n个整数排序,这样排在最前面的k个数就是最小的k个数。只是这种思路的时间复杂度为O(nlogn)。我们试着寻找更快的解决思路。
我们可以开辟一个长度为k的数组。每次从输入的n个整数中读入一个数。如果数组中已经插入的元素少于k个,则将读入的整数直接放到数组中。否则长度为k的数组已经满了,不能再往数组里插入元素,只能替换了。如果读入的这个整数比数组中已有k个整数的最大值要小,则用读入的这个整数替换这个最大值;如果读入的整数比数组中已有k个整数的最大值还要大,则读入的这个整数不可能是最小的k个整数之一,抛弃这个整数。这种思路相当于只要排序k个整数,因此时间复杂可以降到O(n+nlogk)。通常情况下k要远小于n,所以这种办法要优于前面的思路。
这是我能够想出来的最快的解决方案。不过从给面试官留下更好印象的角度出发,我们可以进一步把代码写得更漂亮一些。从上面的分析,当长度为k的数组已经满了之后,如果需要替换,每次替换的都是数组中的最大值。在常用的数据结构中,能够在O(1)时间里得到最大值的数据结构为最大堆。因此我们可以用堆(heap)来代替数组。
另外,自己重头开始写一个最大堆需要一定量的代码。我们现在不需要重新去发明车轮,因为前人早就发明出来了。同样,STL中的set和multiset为我们做了很好的堆的实现,我们可以拿过来用。既偷了懒,又给面试官留下熟悉STL的好印象,何乐而不为之?
参考代码:
- #include <set>
- #include <vector>
- #include <iostream>
- using namespace std;
- typedef multiset<int, greater<int> > IntHeap;
- ///
- // find k least numbers in a vector
- ///
- void FindKLeastNumbers
- (
- const vector<int>& data, // a vector of data
- IntHeap& leastNumbers, // k least numbers, output
- unsigned int k
- )
- {
- leastNumbers.clear();
- if(k == 0 || data.size() < k)
- return;
- vector<int>::const_iterator iter = data.begin();
- for(; iter != data.end(); ++ iter)
- {
- // if less than k numbers was inserted into leastNumbers
- if((leastNumbers.size()) < k)
- leastNumbers.insert(*iter);
- // leastNumbers contains k numbers and it's full now
- else
- {
- // first number in leastNumbers is the greatest one
- IntHeap::iterator iterFirst = leastNumbers.begin();
- // if is less than the previous greatest number
- if(*iter < *(leastNumbers.begin()))
- {
- // replace the previous greatest number
- leastNumbers.erase(iterFirst);
- leastNumbers.insert(*iter);
- }
- }
- }
- }
//补充的代码
- /*
- 解题报告:
- 1、最简单的办法,给所有数据按升序或降序排序,从中取出相应的k个就可以了,最快的时间复杂度为nlog(n)
- 2、可以考虑维护一个堆,这个堆的中元素的个数为k,然后遍历元素,这时有两种情况:
- 1、堆中元素的个数小于k,这时直接插入即可
- 2、元素的个数为k,这时如果遍历到的元素小于堆中最大的那个元素就将堆中的这个元素删除,将遍历到的元素插入即可
- */
- #include <iostream>
- #include <set>
- #include <vector>
- using namespace std;
- typedef multiset<int, greater<int> > intHeap;
- void FindNumbers(vector<int> &data, int k, intHeap &numbers)
- {
- numbers.clear();
- if (0==k || data.size()<k)
- return ;
- vector<int>::const_iterator iter = data.begin();
- for (; iter!=data.end(); iter++)
- {
- if (numbers.size() < k)
- {
- numbers.insert(*iter);
- }
- else
- {
- intHeap::iterator heapIter = numbers.begin();
- if (*iter < *(numbers.begin()))
- {
- numbers.erase(heapIter);
- numbers.insert(*iter);
- }
- }
- }
- }
- int main()
- {
- int n;
- vector<int> data;
- intHeap numbers;
- while (cin>>n)
- {
- for (int i=0; i<n; ++i)
- {
- int nTemp;
- cin>>nTemp;
- data.push_back(nTemp);
- }
- FindNumbers(data, 4, numbers);
- intHeap::const_iterator iter = numbers.begin();
- for (; iter!=numbers.end(); ++iter)
- {
- cout<<*iter<<" ";
- }
- cout<<endl;
- }
- return 0;
- }
- #include <iostream>
- #include <algorithm>
- #include <vector>
- #include <cmath>
- #include <set>
- using namespace std;
- //print an array of int
- inline void print(int *arr, //the array of int
- int n //the length of array
- )
- {
- for(int i=0;i<n;i++)
- cout<<arr[i]<<"\t";
- cout<<endl;
- }
- typedef multiset<int, greater<int> > IntHeap;
- ///
- // find k least numbers in a vector
- ///
- void FindKLeastNumbers(
- // vector<int>& data, // a vector of data
- int *array,
- unsigned int len,
- IntHeap& leastNumbers, // k least numbers, output
- unsigned int k )
- {
- std::vector <int> data(array, array + len);
- leastNumbers.clear();
- if(k == 0 || data.size() < k)
- return;
- vector<int>::const_iterator iter = data.begin();
- for(; iter != data.end(); ++ iter)
- {
- // if less than k numbers was inserted into leastNumbers
- if((leastNumbers.size()) < k)
- leastNumbers.insert(*iter);
- // leastNumbers contains k numbers and it's full now
- else
- {
- // first number in leastNumbers is the greatest one
- IntHeap::iterator iterFirst = leastNumbers.begin();
- // if is less than the previous greatest number
- if(*iter < *(leastNumbers.begin()))
- {
- // replace the previous greatest number
- leastNumbers.erase(iterFirst);
- leastNumbers.insert(*iter);
- }
- }
- }
- }
- void main()
- {
- int arr[ 10 ] = {3, 4, 8, 6, 0, 1, 5, 7, 2, 9};
- int len = sizeof(arr) / sizeof(int);
- int LeastNumers = 5;
- IntHeap numbers;
- FindKLeastNumbers(arr,len,numbers,LeastNumers);
- IntHeap::const_iterator iter = numbers.begin();
- for (; iter != numbers.end(); ++iter)
- {
- cout<<*iter<<" ";
- }
- cout<<endl;
- }