题目
输入n个整数,找出其中最小的K个数。例如输入4,5,1,6,2,7,3,8这8个数字,则最小的4个数字是1,2,3,4,。
思路
先对原数组进行排序,然后输出前k个数字
排序使用:
1、algorithm中自带的sort
2、冒泡排序
3、快排【待补充】
4、堆排序【待补充】
示例
输入:
vector demo1 = {1,2,3,2,2,2,5,4,2,100,98,34,5,2,1231,2341214,124124324,23421,234666};
int k(7);
输出:
使用stl中sort函数结果: 1 2 2 2 2 2 2 用时: 7.17404 微妙
使用冒泡排序: 1 2 2 2 2 2 2 用时: 9.43953 微妙
代码
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <map>
#include <windows.h>
using namespace std;
/* todo: 暂时调用algorithm中sort进行排序,mark一下,稍后补充:
* 1、快排
* 2、冒泡
* 3、堆排序
* 4、解析s上面调用的源码
*/
class Solution{
public:
// method1 调用algorithm中sort进行排序,能解决问题,但失去本题意义
vector<int> GetLeastNumbers_Solution(vector<int> input, int k) {
vector<int> result;
if (input.empty() || k > input.size())
return result;
sort(input.begin(),input.end());
for (int i = 0; i < k; ++i) {
result.push_back(input[i]);
}
return result;
}
// method2 冒泡排序
vector<int> Method2(vector<int> input, int k){
vector<int> result;
if (input.empty() || k>input.size())
return result;
int length = input.size();
for (int i = 0; i < length; ++i) {
for (int j = 0; j < length-i-1; ++j) {
if(input[j] > input[j+1]){
swap(input[j],input[j+1]);
}
}
}
for (int l = 0; l < k; ++l) {
result.push_back(input[l]);
}
return result;
}
};
int main(){
LARGE_INTEGER start1, start2, start3,fequen, method1, method2, method3;
vector<int> demo1 = {1,2,3,2,2,2,5,4,2,100,98,34,5,2,1231,2341214,124124324,23421,234666};
int k(7);
Solution re;
QueryPerformanceFrequency(&fequen);
QueryPerformanceCounter(&start1);
vector<int> result = re.GetLeastNumbers_Solution(demo1,k);
QueryPerformanceCounter(&method1);
cout << "使用stl中sort函数结果: ";
for (int i = 0; i < result.size(); ++i) {
cout << result[i] << " ";
}
cout << " 用时: "<< ((double)method1.QuadPart - (double)start1.QuadPart)*1000000/((double)fequen.QuadPart) << " 微妙" << endl;
// 方法二:冒泡
QueryPerformanceCounter(&start2);
vector<int> result2 = re.Method2(demo1,k);
QueryPerformanceCounter(&method2);
cout << "使用冒泡排序: ";
for (int j = 0; j < result2.size(); ++j) {
cout << result2[j] << " ";
}
cout << " 用时: "<< ((double)method2.QuadPart - (double)start2.QuadPart)*1000000/((double)fequen.QuadPart) << " 微妙" << endl;
return 0;
}