华为的笔试题

最新推荐文章于 2019-12-01 11:07:21 发布

zhangliang_571

最新推荐文章于 2019-12-01 11:07:21 发布

阅读量828

点赞数

分类专栏：学习

本文链接：https://blog.csdn.net/zhangliang_571/article/details/50847545

版权

学习专栏收录该内容

72 篇文章 0 订阅

订阅专栏

伯乐在线上看到华为的笔试题 http://group.jobbole.com/9866/#comment-31739

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <stdbool.h>
#include <time.h>

#define LEN 100000
#define debug 0
int arr1[LEN] = {42,13,42,88,23,15,2,13,34,16,2,34,6,45,68};
int arr2[LEN] = {12,80,44,52,43,25,42,33,4,6,1,76,24,40,1};
int sum1 =0;
int sum2 =0;

void print_arr(int *p, int len)
{
if(!debug)
return;
int i=0;
for(i=0;i<len;i++)
{
printf("%2d ", *(p+i));
}
printf("\n");

}
int getnearest(bool s1big, int diffTotal,int *zi, int *zj)
{
int nearestDiff = -1;
int tmp = 0;
int i,j;
for(i=0;i<LEN;i++)
{
for(j=0;j<LEN;j++)
{
tmp = (arr1[i]-arr2[j]);
if(abs(tmp) <=diffTotal/2)
{
if((s1big && tmp>0)||(s1big==false && tmp<0))
{
if(abs(tmp)>nearestDiff)
{
nearestDiff = abs(tmp);
*zi =i;
*zj =j;
if(nearestDiff>=diffTotal/2 || nearestDiff>=sum1/LEN)
return nearestDiff;

}
}
}

}
}
return nearestDiff;

}
int main()
{
int i ,j,diffTotal = 0;
int tmp=0;
int ave=0;

#if 0
for(i=0;i<LEN;i++)
{
for(j=9;j>i;j--)
{
if(arr1[j] > arr1[j-1])
{
tmp = arr1[j];
arr1[j] = arr1[j-1];
arr1[j-1] = tmp;
}
if(arr2[j] > arr2[j-1])
{
tmp = arr2[j];
arr2[j] = arr2[j-1];
arr2[j-1] = tmp;
}
}
}
#endif

srand(time(0));
for(i=0;i<LEN;i++)
{
tmp = rand()%1000;
//printf("\nrand():%d",tmp);
arr1[i] = tmp;
tmp = rand()%1000;
arr2[i] = tmp;
}
printf("\n________________________ ori status _________________________\n");
print_arr(arr1, LEN);
print_arr(arr2, LEN);
sum1=0;
sum2=0;
for(i=0;i<LEN;i++)
{
sum1 += arr1[i];
sum2 += arr2[i];
}
diffTotal = abs(sum1-sum2);
printf("\nsum1:%d sum2:%d diffTotal:%d \n", sum1, sum2,diffTotal);

bool s1big = false;
int zi =0,zj=0;
int nearestDiff = -1;
if(sum1>sum2)
s1big = true;
zi=0;
zj=0;
while(diffTotal>(sum1+sum2)%2)
{

nearestDiff = getnearest(s1big, diffTotal,&zi, &zj);
if(nearestDiff <= 0 || nearestDiff>diffTotal/2)
break;
else
{
tmp = arr1[zi];
arr1[zi]=arr2[zj];
arr2[zj]=tmp;
diffTotal = diffTotal - 2* nearestDiff;
printf("\n###### swap ###### nearestDiff:%d, arr1:%d arr2:%d diffT:%d\n", nearestDiff, zi, zj, diffTotal);
}

}

printf("\n________________________ check _________________________\n");
print_arr(arr1, LEN);
print_arr(arr2, LEN);
sum1=0;
sum2=0;
for(i=0;i<LEN;i++)
{
sum1 += arr1[i];
sum2 += arr2[i];
}
diffTotal = abs(sum1-sum2);
printf("\nsum1:%d sum2:%d diffTotal:%d \n", sum1, sum2,diffTotal);

return 0;
}