原题目为:
编写程序计算10个正整数的平均值,找出这10个数中与平均值距离(差值的绝对值)最近的三个数,以距离大小对这三个数排序和输出(与平均值距离小的先输出)。例如输入{33,44,61,2,36,42,56,81,11,17},输出36,42,33这三个数字。
整道题目只给出一个测试用例,且题目明确给出数组的大小和只输出3个数字。
在题目中给出的函数声明中明确返回值为vector<int>类型且形参只有一个也为vector<in>类型,我们根据具体要求可编写出如下函数:(含测试代码)
#include <iostream>
#include<vector>
#include <assert.h>
#include<stdlib.h>
using namespace std;
//快排部分
int RandomInRange(int min, int max)
{
int random = rand() % (max - min + 1) + min;
return random;
}
void Swap(int* num1, int* num2)
{
int temp = *num1;
*num1 = *num2;
*num2 = temp;
}
int Partition(int data[], int length, int start, int end)
{
if (data == nullptr || length <= 0 || start < 0 || end >= length)
return 0;
int index = RandomInRange(start, end);
Swap(&data[index], &data[end]);
int small = start - 1;
for (index = start; index < end; index++)
{
if (data[index] < data[end])
{
++small;
if (small != index)
Swap(&data[small], &data[index]);
}
}
++small;
Swap(&data[small],&data[end]);
return small;
}
void QuickSort(int data[],int length,int start,int end)
{
if (data == nullptr || length <= 0||start<0||end>=length)
return;
int index = Partition(data, length,start,end);
if (index>start)
QuickSort(data, length, start, index - 1);
if (index < end)
QuickSort(data, length, index + 1, end);
}
//函数find主体
vector<int> find(vector<int> num)
{
vector<int>::iterator iter = num.begin();//返回一个迭代器指向向量中的第一个元素
int sum=0;//10个数的和
for (; iter != num.end(); ++iter)
{
sum += *iter;
}
int avg = sum / 10;//10个数的平均值
int array[10];
for (int i = 0; i < 10;++i)
{
array[i] = num[i];
}
int distance[10];//存储距离
for (int j = 0; j < 10; ++j)
{
distance[j] = abs(array[j] - avg);
}
//在数组distance中找到最小的3个数
int start = 0;
int end = 9;
int index = Partition(distance, 10, start, end);
while (index != 2)
{
if (index>2)
{
end = index - 1;
index = Partition(distance, 10, start, end);
}
else
{
start = index + 1;
index = Partition(distance,10,start,end);
}
}
//result存储最小的三个距离(未排序)
int result[3];
for (int k = 0; k < 3; ++k)
{
result[k] = distance[k];
}
QuickSort(result,3,0,2);//对三个最小的距离排序
//realResult存储距离绝对值最小的3个数字(已排好序)
int realResult[3];
for (int i = 0; i < 3; ++i)
{
for (int j = 0; j < 10; ++j)
{
if (array[j] + result[i] == avg || array[j] - result[i] == avg)
realResult[i] = array[j];
}
}
//题目要求返回vector类型,在次做转换
vector<int> smallest;
for (int k = 0; k < 3; ++k)
{
smallest.push_back(realResult[k]);
}
return smallest;
}
//测试代码
void test1()
{
vector<int> test;
test.push_back(33);
test.push_back(44);
test.push_back(61);
test.push_back(2);
test.push_back(36);
test.push_back(42);
test.push_back(56);
test.push_back(81);
test.push_back(11);
test.push_back(17);
vector<int> result = find(test);
for (int i = 0; i < 3; ++i)
{
cout << result[i]<< endl;
}
}
int main(int argc,char* argv[])
{
test1();
return 0;
}