vector中均匀取出任意K个值,核心思想是使用使用double类型的步长来避免误差不断扩大
#include <vector>
#include <iostream>
using namespace std;
bool compare(int a, int b)
{
return a < b; //升序排列
}
int main()
{
//取出K个值,均匀分布在vector里面
vector<int> temp{ 5,1,6,3,4,0,2,7,8,9 };
std::sort(temp.begin(), temp.end(), compare);//排序
int k = 3;//k<temp.size(),k>0
int minIndex = 0;
int maxIndex = temp.size()-1;
//int step = ceil((double )temp.size() / (double)k);
double step = (double)(maxIndex - minIndex) / k;
printf("K:%d,all number:%d,step:%lf\n",k, temp.size(),step);
double MiddleIndex = step;
for (int i = 0; i < k;i++ )
{
//printf("%d\n", temp[i]);
//i += step;
if (i == 0)
{
printf("%d\n", temp[minIndex]);
continue;
}
if (i == 1)
{
printf("%d\n", temp[maxIndex]);
continue;
}
else
{
//int step = ceil((double)(maxIndex - minIndex)/2.0);
MiddleIndex += step;
printf("%d\n", temp[(int)MiddleIndex]);
}
}
return 0;
}