華為C語言機(jī)試題面試題匯總[共38頁]

1第一題的題目大概是輸入整型數(shù)組求數(shù)組的最小數(shù)和最大數(shù)之和，例如輸入1,2,3,4則輸出為5，當(dāng)輸入只有一個(gè)數(shù)的時(shí)候，則最小數(shù)和最大數(shù)都是該數(shù)，例如只輸入1，則輸出為2；另外數(shù)組的長度不超過50#include<stdio.h>main()         int num50=0;         int i,n;          printf("請輸入整型數(shù)組的長度(150)：");         scanf("%d",&n);                    printf("請輸入整型數(shù)組的元素：");         for (i=0;i<n;i+)                            scanf("%d",&numi);                        int min_num=num0;         int max_num=num0;         for(int j=0;j<n;j+)                            if(max_num<numj)                            max_num=numj;                   else if(min_num>numj)                            min_num=numj;                  int sum=min_num+max_num;         printf("數(shù)組中最大與最小值之和：%dn",sum);         return 0; 2求兩個(gè)長長整型的數(shù)據(jù)的和并輸出，例如輸入1233333333333333 。 3111111111111111111111111.。，則輸出。#include<stdio.h>#include<string.h>#include<malloc.h>main()         char *num1,*num2;  /兩個(gè)長長整型數(shù)據(jù)         char *sum;/      int temp;int len_num1,len_num2; / 兩個(gè)長長整型數(shù)據(jù)的長度         int len_max,len_min;         num1=(char*)malloc(sizeof(char);         num2=(char*)malloc(sizeof(char);         printf("輸入兩個(gè)長長整型數(shù)據(jù)：");         scanf("%s",num1);         printf("輸入兩個(gè)長長整型數(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;         int len_max1=len_max;         sum=(char*)malloc(sizeof(char)*len_max);         memset(sum,0x00,len_max+1);/切忌初始化         for(;len_num1>0&&len_num2>0;len_num1-,len_num2-)                  sumlen_max-=(num1len_num1-1-'0')+(num2len_num2-1-'0');                  if(len_num1>0)                            sumlen_max-=num1len_num1 - 1 -'0'                   len_num1-;                  if(len_num2>0)                            sumlen_max-=num1len_num2 - 1-'0'                   len_num2-;                  for(int j=len_max1;j>=0;j-) /實(shí)現(xiàn)進(jìn)位操作                  /      temp=sumj-'0'                   if(sumj>=10)                                      sumj-1+=sumj/10;                            sumj%=10;                                     char *outsum=(char*)malloc(sizeof(char)*len_max1);         j=0;         while(sumj=0)  /跳出頭部0元素                   j+;         for(int m=0;m<len_max1;j+,m+)                   outsumm=sumj+'0'         outsumm='0'    printf("輸出兩長長整型數(shù)據(jù)之和:%sn",outsum);         return 0; 3.通過鍵盤輸入一串小寫字母(az)組成的字符串。請編寫一個(gè)字符串過濾程序，若字符串中出現(xiàn)多個(gè)相同的字符，將非首次出現(xiàn)的字符過濾掉。比如字符串“abacacde”過濾結(jié)果為“abcde”。要求實(shí)現(xiàn)函數(shù)：void stringFilter(const char *pInputStr, long lInputLen, char *pOutputStr);【輸入】 pInputStr：輸入字符串lInputLen：輸入字符串長度【輸出】 pOutputStr：輸出字符串，空間已經(jīng)開辟好，與輸入字符串等長；#include <stdio.h>#include<string.h>#include<malloc.h>void stringFilter(const char *p_str, long len, char *p_outstr)int array256=0;const char *tmp = p_str;for(int j=0;j<len;j+)          if(arraytmpj=0)                   *p_outstr+= tmpj;         arraytmpj+;          *p_outstr = '0' void main()         char  *str = "cccddecc"         int len = strlen(str);                   char * outstr = (char *)malloc(len*sizeof(char);         stringFilter(str,len,outstr);         printf("%sn",outstr);         free(outstr);         outstr = NULL; 4.通過鍵盤輸入一串小寫字母(az)組成的字符串。請編寫一個(gè)字符串壓縮程序，將字符串中連續(xù)出席的重復(fù)字母進(jìn)行壓縮，并輸出壓縮后的字符串。壓縮規(guī)則：1. 僅壓縮連續(xù)重復(fù)出現(xiàn)的字符。比如字符串"abcbc"由于無連續(xù)重復(fù)字符，壓縮后的字符串還是"abcbc".2. 壓縮字段的格式為"字符重復(fù)的次數(shù)+字符"。例如：字符串"xxxyyyyyyz"壓縮后就成為"3x6yz" 要求實(shí)現(xiàn)函數(shù)：void stringZip(const char *pInputStr, long lInputLen, char *pOutputStr); 【輸入】 pInputStr： 輸入字符串lInputLen： 輸入字符串長度【輸出】 pOutputStr： 輸出字符串，空間已經(jīng)開辟好，與輸入字符串等長；#include <stdio.h>#include<string.h>#include<malloc.h> void stringZip(const char *p_str, long len, char *p_outstr)         int count=1;         for(int i=0;i<len;i+)                            if(p_stri=p_stri+1)                                               count+;                                      else                                               if(count>1)                                                                 *p_outstr+ = count +'0'                                     *p_outstr+ =p_stri;                                                        else                                                                 *p_outstr+ =p_stri;                                                        count = 1;/注意其位置                                     *p_outstr = '0' void main()         char *str = "cccddecc"    printf("壓縮之前的字符串為：%sn",str);         int len = strlen(str);         char * outstr = (char*)malloc(len*sizeof(char);         stringZip(str,len,outstr);         printf("壓縮之后的字符串為：%sn",outstr);         free(outstr);         outstr = NULL;5.通過鍵盤輸入100以內(nèi)正整數(shù)的加、減運(yùn)算式，請編寫一個(gè)程序輸出運(yùn)算結(jié)果字符串。輸入字符串的格式為：“操作數(shù)1 運(yùn)算符 操作數(shù)2”，“操作數(shù)”與“運(yùn)算符”之間以一個(gè)空格隔開。 補(bǔ)充說明：1. 操作數(shù)為正整數(shù)，不需要考慮計(jì)算結(jié)果溢出的情況。2. 若輸入算式格式錯(cuò)誤，輸出結(jié)果為“0”。 要求實(shí)現(xiàn)函數(shù)：void arithmetic(const char *pInputStr, long lInputLen, char *pOutputStr); 【輸入】 pInputStr： 輸入字符串lInputLen： 輸入字符串長度【輸出】 pOutputStr： 輸出字符串，空間已經(jīng)開辟好，與輸入字符串等長；#include <stdio.h>#include<string.h>#include<stdlib.h>void arithmetic(const char *input, long len, char *output)         char s110;         char s210;         char s310;         int cnt = 0;         int len_input=strlen(input);         for(int i=0;i<len_input;+i)                            if(inputi=' ')                            cnt+;                   if(cnt!=2)                            *output+ = '0'                   *output = '0'                   return;                   sscanf(input,"%s %s %s",s1,s2,s3);         if(strlen(s2)!=1|(s20!='+'&&s20!='-')                            *output+ = '0'                   *output = '0'                   return;                    int len_s1=strlen(s1);         for(i=0;i<len_s1;i+)                            if(s1i<'0'|s1i>'9')                                               *output+ = '0'                            *output = '0'                            return;                                      int len_s3=strlen(s3);         for(i=0;i<len_s3;i+)                            if(s3i<'0'|s3i>'9')                                               *output+ = '0'                            *output = '0'                            return;                                      int x = atoi(s1);         int y = atoi(s3);         if(s20='+')                            int result = x+y;                   itoa(result,output,10);                  else if(s20='-')                            int result = x-y;                   itoa(result,output,10);                  else                            *output+ = '0'                   *output = '0'                   return;           void main()         char str = "10 - 23"         char outstr10;         int len = strlen(str);         arithmetic(str,len,outstr);         printf("%sn",str);         printf("%sn",outstr);      6.一組人（n個(gè)），圍成一圈，從某人開始數(shù)到第三個(gè)的人出列，再接著從下一個(gè)人開始數(shù)，最終輸出最終出列的人（約瑟夫環(huán)是一個(gè)數(shù)學(xué)的應(yīng)用問題：已知n個(gè)人（以編號1，2，3.n分別表示）圍坐在一張圓桌周圍。從編號為k的人開始報(bào)數(shù)，數(shù)到m的那個(gè)人出列；他的下一個(gè)人又從1開始報(bào)數(shù)，數(shù)到m的那個(gè)人又出列；依此規(guī)律重復(fù)下去，直到圓桌周圍的人全部出列。）#include <stdio.h>#include<string.h>#include<stdlib.h>#include<malloc.h> typedef struct Node         int data;         struct Node *next;LinkList; LinkList *create(int n)         LinkList *p,*q,*head;         int i=1;         p=(LinkList*)malloc(sizeof(LinkList);         p->data=i;         head=p;          for(i=1;i<=n;i+)                            q=(LinkList*)malloc(sizeof(LinkList);                   q->data=i+1;                   p->next=q;                   p=q;                  p->next=head;  /使鏈表尾連接鏈表頭，形成循環(huán)鏈表         return head;         free(p);         p=NULL;         free(q);         q=NULL; void deletefun(LinkList *L,int m)         LinkList *p,*q,*temp;         int i;         p=L;          while(p->next!=p)                            for(i=1;i<m;i+)                                               q=p;                            p=p->next;                                      printf("%5d",p->data);                   temp=p;                   q->next=p->next;                   p=p->next;                   free(temp);                  printf("%5dn",p->data); int main()         int n=7,m=3;         LinkList *head1;         head1=create(n);         deletefun(head1,m);         return 0;7.輸入一串字符，只包含“0-10”和“，”找出其中最小的數(shù)字和最大的數(shù)字（可能不止一個(gè)），輸出最后剩余數(shù)字個(gè)數(shù)。如輸入 “3,3,4,5,6,7,7”#include<stdio.h>#include<stdlib.h>#include<string.h> void main()         char str100;         printf("輸入一組字符串：n");         scanf("%s",&str);          int len=strlen(str);         int array100;         int count=0;         for(int i=0;i<len;i+)                            if(stri>='0'&&stri<='9')                            arraycount+=stri-'0'                          arraycount='0'         int result=count;         int min=array0;         int max=array0;         for(int j=0;j<count;j+)                            if(max<arrayj)                            max=arrayj;                   else if(min>arrayj)                            min=arrayj;                  for(int k=0;k<count;k+)                            if(arrayk=min)                            result-;                   if(arrayk=max)                            result-;                  printf("%dn",result);8.輸入一組身高在170到190之間（5個(gè)身高），比較身高差，選出身高差最小的兩個(gè)身高；若身高差相同，選平均身高高的那兩個(gè)身高；從小到大輸出；如輸入 170 181 173 186 190輸出 170 173#include<stdio.h>#include<stdlib.h>#define N 5 int main()         int HeightN;         int dmin;         int H1,H2;         int i,j,temp;          printf("請輸入一組身高在170到190之間的數(shù)據(jù)（共5個(gè)）:n");         for(int k=0;k<N;k+)         scanf("%d",&Heightk);         printf("n");          for(i=0;i<N;i+)                   for(j=1;j<N-i&&Heightj-1>Heightj;j+)                                               temp=Heightj-1;                            Heightj-1=Heightj;                            Heightj=temp;                             H1=Height0;         H2=Height1;         dmin=H2-H1;         for(int m=2;m<N;m+)                            if(Heightm-Heightm-1<=dmin)                                               H1=Heightm-1;                            H2=Heightm;                            dmin=Heightm-Heightm-1;                                     printf("身高差最小的兩個(gè)身高為:n");         printf("%d,%dn",H1,H2);         return 0;9.刪除子串，只要是原串中有相同的子串就刪掉，不管有多少個(gè)，返回子串個(gè)數(shù)。#include <stdio.h>#include <stdlib.h>#include <assert.h>#include <string.h>int delete_sub_str(const char *str,const char *sub_str,char *result)         assert(str != NULL && sub_str != NULL);         const char *p,*q;         char *t,*temp;         p = str;         q = sub_str;         t = result;         int n,count = 0;         n = strlen(q);         temp = (char *)malloc(n+1);         memset(temp,0x00,n+1);         while(*p)                            memcpy(temp,p,n);                   if(strcmp(temp,q) = 0 )                                               count+;                            memset(temp,0x00,n+1);                            p = p + n;                                      else                                                      *t = *p;                            p+;                            t+;                            memset(temp,0x00,n+1);                                            free(temp);         return count;void main()         char s100 = 0;         int num = delete_sub_str(“123abc12de234fg1hi34j123k”,”123”,s);         printf(“The number of sub_str is %drn”,num);         printf(“The result string is %srn”,s);10. 要求編程實(shí)現(xiàn)上述高精度的十進(jìn)制加法。要求實(shí)現(xiàn)函數(shù)：void add (const char *num1, const char *num2, char *result)【輸入】num1：字符串形式操作數(shù)1，如果操作數(shù)為負(fù)，則num10為符號位'-'num2：字符串形式操作數(shù)2，如果操作數(shù)為負(fù)，則num20為符號位'-'【輸出】result：保存加法計(jì)算結(jié)果字符串，如果結(jié)果為負(fù)，則result0為符號位。#include<stdio.h> #include<stdlib.h> #include<string.h>   void move(char *str, int length)    /移除字母前的"-"符號        if(str0 != '-')         return;     int i;     for(i = 0; i < length-1; i+)         stri = stri+1;     stri = '0'   int remove_zero(char *result, int length)      int count = 0;     for(int i = length-1; i > 0; i-)    /從最后開始移除0，直到遇到非0數(shù)字，只對最初位置上的0不予判斷              if(resulti = '0')                      resulti = '0'             count+;         else             return length-count;          return length - count;   void reverse(char *result, int length)        /將字符串倒轉(zhuǎn)      char temp;     for(int i = 0; i <= (length-1)/2; i+)              temp = resulti;         resulti = resultlength-1-i;         resultlength-1-i = temp;        int real_add(char *str1, char *str2, char *result, const bool flag)      int len1 = strlen(str1);     int len2 = strlen(str2);     int n1, n2, another = 0;    /another表示進(jìn)位     int cur_rs = 0;        /表示result的當(dāng)前位數(shù)     int i, j;     int curSum;     for(i = len1-1, j = len2-1; i >= 0 && j >= 0; i-, j-)              n1 = str1i - '0'         n2 = str2j - '0'         curSum = n1 + n2 + another;         resultcur_rs+ = curSum % 10 + '0'         another = curSum / 10;           if(j < 0)              while(i >= 0)        /遍歷str1剩余各位                      n1 = str1i- - '0'             curSum = n1 + another;             resultcur_rs+ = curSum % 10 + '0'             another = curSum / 10;                  if(another != 0)        /如果還有進(jìn)位未加上             resultcur_rs+ = another + '0'               else                   while(j >= 0)                      n2 = str2j- - '0'             curSum = n2 + another;             resultcur_rs+ = curSum % 10 + '0'             another = curSum / 10;                  if(another != 0)             resultcur_rs+ = another + '0'           resultcur_rs = '0'      cur_rs = remove_zero(result, cur_rs);     if(!flag)              resultcur_rs+ = '-'         resultcur_rs = '0'          reverse(result, strlen(result);     return cur_rs;    int real_minus(char *str1, char *str2, char *result)    /使用str1減去str2      char big100, small100;     int big_len, sml_len;      int len1 = strlen(str1);     int len2 = strlen(str2);     bool flag = false;        /用于標(biāo)記str2是否比str1大      if(len1 < len2)         flag = true;     else if(len1 = len2)              if(strcmp(str1, str2) = 0)                      result0 = '0'             result1 = '0'             return 1;         else if(strcmp(str1,str2) < 0)             flag = true;           if(flag)    /將str1和str2交換，確保str1指向的值是其中較大者，最后通過flag確定要不要給前面加-號              char *temp = str1;         str1 = str2;         str2 = temp;         len1 = strlen(str1);         len2 = strlen(str2);           int n1, n2, another = 0;    /another表示是否有借位     int i, j;     int cur_rs = 0;     int curMinus;  for(i = len1-1, j = len2-1; i>=0 && j>=0; i-,j-)              n1 = str1i - '0'         n2 = str2j - '0'         if(n1 >= n2+another)                      resultcur_rs+ = (n1-n2-another) +'0'             another = 0;                  else                      resultcur_rs+ = (n1+10-n2-another) + '0'             another = 1;                    while(i >= 0)              n1 = str1i- - '0'         if(another != 0)                      n1 -= another;             another = 0;                  resultcur_rs+ = n1 + '0'           resultcur_rs = '0'     cur_rs = remove_zero(result, cur_rs);     if(flag)              resultcur_rs+ = '-'         resultcur_rs = '0'          reverse(result, cur_rs);      return cur_rs;   void addi(const char *num1, const char *num2, char *result)      int len1 = strlen(num1);     int len2 = strlen(num2);     int rs_len;     if(!len1 | !len2)             return;     char str1100, str2100;     strncpy(str1, num1, len1);     str1len1 = '0'     strncpy(str2, num2, len2);     str2len2 = '0'      if(str10 = '-' && str20 = '-')              move(str1, len1);         move(str2, len2);         rs_len = real_add(str1, str2, result, false);     else if(str10 = '-')              move(str1, len1);         rs_len = real_minus(str2, str1, result);          else if(str20 = '-')              move(str2, len2);         rs_len = real_minus(str1, str2, result);     else         rs_len = real_add(str1, str2, result, true);   /int main(int argc, char *argv) int main()      char num1100,num2100;          printf("請輸入兩個(gè)整型數(shù)據(jù)：n");          scanf("%s%s",num1,num2);           char result100;     memset(result, 0, 100);     addi(num1,num2, result);     printf("%sn", result);      return 0; 11.描述：10個(gè)學(xué)生考完期末考試評卷完成后，A老師需要?jiǎng)澇黾案窬€，要求如下：(1) 及格線是10的倍數(shù)；(2) 保證至少有60%的學(xué)生及格；(3) 如果所有的學(xué)生都高于60分，則及格線為60分輸入：輸入10個(gè)整數(shù)，取值0100輸出：輸出及格線，10的倍數(shù)#include<stdio.h> void bubblesort(int arr)         int i,j,temp;         for(i=0;i<10;i+)                   for(j=0;j<9-i&&arrj>arrj+1;j+)                                               temp=arrj;                            arrj=arrj+1;                            arrj+1=temp;                    int GetPassLine(int a)         bubblesort(a);         if(a0>=60)                   return 60;         else                   return (int)a4/10)*10); main()         int a10=0;         int result;         printf("請隨機(jī)輸入10個(gè)成績（0-100）：n");         scanf("%d%d%d%d%d%d%d%d%d%d",&a0,&a1,&a2,&a3,&a4,&a5,&a6,&a7,&a8,&a9);         printf("n");         result=GetPassLine(a);         printf("及格線為:%dn",result);         return 1; 12.描述：一條長廊里依次裝有n(1 n 65535)盞電燈，從頭到尾編號1、2、3、n-1、n。每盞電燈由一個(gè)拉線開關(guān)控制。開始，電燈全部關(guān)著。有n個(gè)學(xué)生從長廊穿過。第一個(gè)學(xué)生把號碼凡是1的倍數(shù)的電燈的開關(guān)拉一下；接著第二個(gè)學(xué)生把號碼凡是2的倍數(shù)的電燈的開關(guān)拉一下；接著第三個(gè)學(xué)生把號碼凡是3的倍數(shù)的電燈的開關(guān)拉一下；如此繼續(xù)下去，最后第n個(gè)學(xué)生把號碼凡是n的倍數(shù)的電燈的開關(guān)拉一下。n個(gè)學(xué)生按此規(guī)定走完后，長廊里電燈有幾盞亮著。注：電燈數(shù)和學(xué)生數(shù)一致。輸入：電燈的數(shù)量輸出：亮著的電燈數(shù)量樣例輸入：3樣例輸出：1 #include<stdio.h>#define Max_Bubl_Num 65535 int GetLightLampNum(int n)         int BublNumMax_Bubl_Num=0;  /0表示燈滅，1表示燈亮         unsigned int i,j;         unsigned int count=0;         for(i=1;i<=n;i+)                   for(j=i;j<=n&&j%i=0;j+)                                               BublNumj-1+=1;                            BublNumj-1=BublNumj-1%2;                             for(int k=0;k<n;k+)                            if(BublNumk=1)                            count+;                  return count;int main()         int n,result;         printf("請輸入燈的數(shù)量（1-65535）:n");         scanf("%d",&n);         result=GetLightLampNum(n);         printf("最后亮燈的數(shù)量為:%dn",result);