《2019華為校園招聘面試》由會(huì)員上傳分享，免費(fèi)在線閱讀，更多相關(guān)內(nèi)容在行業(yè)資料-天天文庫。

1、1．輸入整型數(shù)組求數(shù)組的最小數(shù)和最大數(shù)之和，例如輸入1,2,3,4則輸出為5，當(dāng)輸入只有一個(gè)數(shù)的時(shí)候，則最小數(shù)和最大數(shù)都是該數(shù)，例如只輸入1，則輸出為2；另外數(shù)組的長(zhǎng)度不超過50參考代碼：#includemain(){????intnum[50]={0};????inti,n;?????printf(“請(qǐng)輸入整型數(shù)組的長(zhǎng)度(1~50)：”);????scanf(“%d”,&n);?????????printf(“請(qǐng)輸入整型數(shù)組的元素：”);????for(i=0;i

2、ntmin_num=num[0];????intmax_num=num[0];????for(intj=0;jnum[j])????????????min_num=num[j];????}????intsum=min_num+max_num;????printf(“數(shù)組中最大與最小值之和：%d”,sum);????return0;}??2．求兩個(gè)長(zhǎng)長(zhǎng)整型的數(shù)據(jù)的和并輸出，例如輸入1233333333333333。。

3、。3111111111111111111111111.。。。，則輸出。。。。?#include#include#includemain(){????char*num1,*num2;//兩個(gè)長(zhǎng)長(zhǎng)整型數(shù)據(jù)????char*sum;//????inttemp;intlen_num1,len_num2;//兩個(gè)長(zhǎng)長(zhǎng)整型數(shù)據(jù)的長(zhǎng)度????intlen_max,len_min;????num1=(char*)malloc(sizeof(char));????num2=(char*)malloc(sizeof(char));????printf(“

4、輸入兩個(gè)長(zhǎng)長(zhǎng)整型數(shù)據(jù)：”);????scanf(“%s”,num1);????printf(“輸入兩個(gè)長(zhǎng)長(zhǎng)整型數(shù)據(jù)：”);????scanf(“%s”,num2);????len_num1=strlen(num1);????len_num2=strlen(num2);????len_max=(len_num1>=len_num2)?len_num1:len_num2;????len_min=(len_num1<=len_num2)?len_num1:len_num2;????intlen_max1=len_max;????sum=(char*)malloc(sizeof(char)*len_

5、max);????memset(sum,0×00,len_max+1);//切忌初始化????for(;len_num1>0&&len_num2>0;len_num1–,len_num2–)????{????sum[len_max--]=((num1[len_num1-1]-’0′)+(num2[len_num2-1]-’0′));????}????if(len_num1>0)????{????????sum[len_max--]=num1[len_num1-1]-’0′;????????len_num1–;????}????if(len_num2>0)????{????????sum[le

6、n_max--]=num1[len_num2-1]-’0′;????????len_num2–;????}????for(intj=len_max1;j>=0;j–)//實(shí)現(xiàn)進(jìn)位操作????{????//????temp=sum[j]-’0′;????????if(sum[j]>=10)????????{????????sum[j-1]+=sum[j]/10;????????????sum[j]%=10;????????}????}????char*outsum=(char*)malloc(sizeof(char)*len_max1);????j=0;????while(sum[j]==0)

7、//跳出頭部0元素????????j++;????for(intm=0;m