华为的面试题,要求8分钟写出一段程序:
有两个数组a,b,大小都为n,数组元素的值任意,无序;
要求:通过交换a,b中的元素,使数组a元素的和与数组b元素的和之间的差最小
#include <iostream>
using namespace std;
#define n 5
int a[] = { 1,6,7,9,20};
int b[] = { 2,6,18,19,22 };
void swap(int &a,int &b)//两数交换
{
a=a^b;
b=a^b;
a=a^b;
}
// a 于b 合并到buf, a,b长度都为len
void fillArray(int *buf, int * a, int * b)
{
int i;
for (i = 0; i < n; i++)
{
buf[i*2]=a[i];
buf[i*2+1]=b[i];
}
cout<<"合并后:";
for (i = 0; i < n*2; i++)
{
cout<<buf[i]<<" ";
}
cout<<endl;
}
// 打印数组
void printArray(int *arr)
{
for (int i = 0; i < n; i++)
{
cout << * (arr + i) << ' ';
}
}
//冒泡排序, 从小到大
void sort(int* arr, int len)
{
for (int i = 0; i < len; i++)
{
for (int j = i + 1; j < len; j++)
{
if (arr[i] > arr[j])
{
swap(arr[i],arr[j]);
}
}
}
}
// 求和
int sum(int* arr)
{
int tmp=n;
int s = 0;
while (--tmp >= 0)
{
s += *(arr + tmp);
}
return s;
}
int main()
{
cout<<"计算前:/n";
cout << "a: "; printArray(a); cout << " = " << sum(a) << '/n';
cout << "b: "; printArray(b); cout << " = " << sum(b) << '/n';
int * two = new int[2 * n];
fillArray(two,a,b);//先合并
sort(two, 2 * n);
int indexA = n - 1;
int indexB = n - 1;
int sumA = 0;
int sumB = 0;
int i = 0;
for(i = 2 * n - 1;i>= 0; i--)
{
bool full = false;
if(indexA < 0)
{
b[indexB--] = two[i];
full = true;
}
else if(indexB < 0)
{
a[indexA--] = two[i];
full = true;
}
if(full)
continue;
if(sumA <sumB)
{
a[indexA--] = two[i];
sumA+=two[i];
}
else
{
b[indexB--] = two[i];
sumB+=two[i];
}
}
cout<<"计算后:/n";
cout << "a: "; printArray(a); cout << " = " << sum(a) << '/n';
cout << "b: "; printArray(b); cout << " = " << sum(b) << '/n';
return 0;
}