2014校园招聘机试及本人面试经历

1,2,3,45，当输入只有一1250{intnum[50]={0};inti,n;

intmin_num=num[0];intmax_num=num[0];for(intj=0;j<n;j++){

elseif(min_num>num[j])}for{intreturn}}求两个长长整型的数据的和并输出，例如输入1233333333333333。 {char*num1,*num2; char*sum; intintlen_num1,len_num2;//intlen_max,len_min;intlen_max1=len_max;

{}{sum[len_max--]=num1[len_num1-1]-'0';}{sum[len_max--]=num1[len_num2-1]-'0';}--)//{ { //0

return0;}abcdevoidstringFilter(constchar*pInputStr,longlInputLen,charpInputStrlInputLen#include<stdio.h>voidstringFilter(constchar*p_str,longlen,char{intconstchar*tmp=p_str;for(intj=0;j<len;j++){*p_outstr++=tmp[j];}*p_outstr=}void{ *str="cccddecc";intlen=strlen(str);char*outstr=(char*)malloc(len*sizeof(char));outstr=}压缩字段的格式为"字符重复的次数+字符"。例如：字符串"xxxyyyyyyz"压缩后就成为voidstringZip(constchar*pInputStr,longlInputLen,charpInputStr：lInputLen：pOutputStr：#includevoidstringZip(constchar*p_str,longlen,char{int{{}{{*p_outstr++=count*p_outstr++}

*p_outstr++}count1;//}}*p_outstr=}void{char*str=intlen=strlen(str);char*outstr=(char*)malloc(len*sizeof(char));outstr=}若输入算式格式错误，输出结果为“0”voidarithmetic(constchar*pInputStr,longlInputLen,charpInputStr：lInputLen：pOutputStr：#includevoidarithmetic(constchar*input,longlen,char{chars1[10];chars2[10];chars3[10];intcnt=0;intlen_input=strlen(input);for(inti=0;i<len_input;++i){if(input[i]=='')}{*output++=*output='\0';}sscanf(input,"%s%s{*output++=*output='\0';}intlen_s1=strlen(s1);{{*output++=*output='\0';}}intlen_s3=strlen(s3);{{*output++=*output='\0';}}intx=atoi(s1);inty=atoi(s3);{intresult=}elseif(s2[0]=='-{}{

intresult=x-*output++=*output='\0';}}void{charstr[]={"10-23"};charoutstr[10];intlen=strlen(str);}m1m的那个人又出列；依此规律重复下#include<stdio.h>typedefstruct{intstructNodeLinkList*create(int{LinkList*p,*q,*head;inti=1;{} returnhead;}voiddeletefun(LinkList*L,int{LinkList*p,*q,*temp;inti;{{}}}int{intn=7,m=3;LinkList*head1;return0;}如输入“3,3,4,5,6,7,7”void{charintlen=strlen(str);intarray[100];int{}intresult=count;intmin=array[0];int{elseif(min>array[j])}{}}170190之间（5个身高170181173186190170#defineN5int{intHeight[N];intdmin;intintprintf("170190之间的数据（5个）:\n");for(intk=0;k<N;k++){}{{}}return}#include<stdio.h>#include<stdlib.h>#include<assert.h>#include<string.h>{assert(str!=NULL&&sub_str!=NULL);constchar*p,*q;charp=q=sub_str;t=result;intn,count=0;n=strlen(q);temp=(char*)malloc(n+1);{if(strcmp(temp,q)==0{}{}}

p=p+n;*t=*p;}void{chars[100]=printf(“Thenumberofsub_stris%d\r\n”,num);printf(“Theresultstringis}voidadd(constchar*num1,constchar*num2,char【输入】num11num1[0]为符号位'-'voidmove(char*strint {if(str[0]!='-')intfor(i=0;i<length-1;i++)str[i]=str[i+1];str[i]=}intremove_zero(char*result,int{intcount=for(intilength-1;i0;i //000{if(result[i]=={}

result[i]='\0';returnlength-returnlength-}voidreverse(char*resultint //{charfor(inti=0;i<=(length-1)/2;{temp=result[i]=result[length-1-i];result[length-1-i]=temp;}}intreal_add(char*str1,char*str2,char*result,constbool{intlen1=strlen(str1);intlen2=intn1,n2,another=0; //another表示进位intcur_rs=0; //表示result的当前位数inti,j;intfor(i=len1-1,j=len2-1;i>=0&&j>=0;i--,j--{n1=str1[i]-n2=str2[j]-curSum=n1+n2+result[cur_rs++]=curSum%10+'0';another=curSum/10;}if(j<{while(i //str1{n1=str1[i--]-curSum=n1+result[cur_rs++]=curSum%10+'0';another=curSum/10;}}{

if(another!=0) result[cur_rs++]=another+'0';while(j>={n2=str2[j--]-curSum=n2+result[cur_rs++]=curSum%10+'0';another=curSum/10;}if(another!=result[cur_rs++]=another+}result[cur_rs]=cur_rs=remove_zero(result,cur_rs);{result[cur_rs++]='-';result[cur_rs]='\0';}returncur_rs;}intreal_minus(char*str1,char*str2,char //str1{charbig[100],small[100];intbig_len,sml_len;intlen1=strlen(str1);intlen2=boolflag //str2str1if(len1<flag=elseif(len1=={if(strcmp(str1,str2)=={result[0]=result[1]='\0';return1;}elseif(strcmp(str1,str2)<0)flag=true;} //str1str2str1flag确定要不要给前面加-{char*temp=str1;str1=str2;str2=len1=strlen(str1);len2=}intn1n2,another //anotherinti,intcur_rs=intfor(i=len1-1,j=len2-1;i>=0&&j>=0;i--,j--{n1=str1[i]-n2=str2[j]-if(n1>={}{}}

result[cur_rs++]=(n1-n2-another)+'0';another=0;result[cur_rs++]=(n1+10-n2-another)+'0';another=1;while(i>={n1=str1[i--]-if(another!={n1-=another;another=0;}result[cur_rs++]=n1+}result[cur_rs]=cur_rs=remove_zero(result,cur_rs);{result[cur_rs++]='-';result[cur_rs]='\0';}return}voidaddi(constchar*num1,constchar*num2,char{intlen1=strlen(num1);intlen2=strlen(num2);intrs_len;if(!len1||charstr1[100],str2[100];strncpy(str1,num1,len1);str1[len1]='\0';strncpy(str2,num2,len2);str2[len2]='\0';if(str1[0]=='-'&&str2[0]=='-{move(str1,len1);move(str2,rs_len=real_add(str1,str2,result,}elseif(str1[0]=='-{move(str1,rs_len=real_minus(str2,str1,}elseif(str2[0]=='-{}

move(str2,rs_len=real_minus(str1,str2,result);rs_len=real_add(str1,str2,result,true);//intmain(intargc,char*argv[])intmain(){charcharmemset(result,0,100);addi(num1,num2,result);printf("%s\n",result);return}voidbubblesort(int{inti,j,temp;{}}intGetPassLine(int{return}

return{inta[10]={0};intresult;printf("10个成绩（0-100：\n");return1;}n(1n655351、2、3、…n-1、n。每盏电灯由一个#defineMax_Bubl_NumintGetLightLampNum(int{int //0表示灯灭，1unsignedinti,j;unsignedintcount=0;{BublNum[j-}{}return}int{intreturn0;}T1、T2A（环线）经过车站：A1A2A3A4A5A6A7A8A9T1A10A11A12A13T2A14A15A16A17B（直线）经过车站：B1B2B3B4B5T1B6B7B8B9B10T2B11B12B13B14输入样例：A1A3usingnamespacestd;#defineMAXtypedefstructnode{intstructnodetypedefcharname[10];boolflag;edgenode voidcreat(vexnodega[]){inti;edgenode*p;elsestrcpy(ga[i].name,subway_name2[i-20]);}//Ap-p-}elsep-p-}}//Bif(i==4||i==5||i==9||i==10)continue;} edgenode*s;}}}intintcharinttemp=0;}intcount=0;intstart=0;intend=1;boolfind_flag=false;if(find_flag)break;printf("第%d层搜索：",count);intprintf("%s}edgenode*s;}}

}}return}‘z’2次。例如：aabc，zzab；当连续voidconvert(char*input,char*char*input,char*output【返回】无voidconvert(char*input,char*{charintlen_input=strlen(input);inti;int{{}{

{}{}}}

}void{char*input="xyz";charoutput[256]; }（“单词”（voidmy_word(charinput[],charcharinput[],charoutput[]【返回】无#includestring.h>#includestdlib.h>#include<stdio.h>voidmy_word(charinput[],char{charcharcharintlen_input=strlen(input);inti,j;charexcept[]=",";char*blank="";for{if(input[i]<'A'||(input[i]>'Z'&&input[i]<'a')||{}}{p=}for(i=0;i<5;i++){for(j=1;j<5-{{}}}for(i=0;i<5;i++){{}}for(j=0;j<5;j++){if{}{}}

return}int{charinput[]="somelocalbuses,some charreturn}１６.intfindUnique(int*a,int{inti=inttemp=a[0];for(;i<len;i++){temp=temp^}printf("%d",}#includeinta[]=intfindXorSum(int*a,int{inti=0;inttemp=0;for(;i<len;{temp=temp^}return}intfindFirstBit1(int{intcount=1;while(!(n&1)){n=}return}intisBit1(inta,int{a=a>>count-1;return(a&1);}voidfindTwoUnique(int*a,int{inti=intm=0,n=inttemp=findXorSum(a,len);intcount=findFirstBit1(temp);for(;i<len;i++){{}{}}

m=m^n=n^printf("%d,%d",m,}int{}k1→2→3→4→5→6，k=2，2→1→4→3→6→5，若k=3,翻转后3→2→1→6→5→4，若k=4，翻转后4→3→2→1→5→6，用程序实现length/k//#include"stdafx.h"#include"stdio.h"#include"stdlib.h"typedefstructNode{intvalue;Node*LinkList*p=NULL;LinkList*pNext=NULL;p=pPre->next;LinkList*p1 =NULL;pNext=pCur-while({p1=p-p->next=pPre;pPre=p;p=}}int{intcount=0,k,i=0,j=0,flag=1,length=0,groups=0;LinkList*pPre=(LinkList*)malloc(sizeof(LinkList));LinkList*pCur=(LinkList*)malloc(sizeof(LinkList));LinkList*pNext=(LinkList*)malloc(sizeof(LinkList));LinkList*head=NULL;LinkList*pTempTailNULL;指向逆转之后的尾部LinkList*pTempHead=NULL;pCur->value=pPre=pCur; for(i=2;i<=6;i++){LinkList*node=(LinkList*)malloc(sizeof(LinkList));node->value=i;pCur->next=node;pCur=node;}pCur->nextNULL;//NULL，c++newpCur={}

pCur=pCur-groupslength/k;KpCur={count=while(count<k-1&&{pCur=pCur->next;}{pNext=pCur-pTempHead=pCur; if(flag==0){}{head=pCur;flag=0;}}{

pCur=}pPre=pCur;}pCur=while(j<length){pCur=pCur->next;} return0;}#include<stdio.h>#include<stdlib.h>#includetypedefstructnode{charval;structnode*Node* ist(intintNode*pHead=Crea printf("beforetransform\n");return1;}//Node* ist(intNode*pHead=(Node*)malloc(sizeof(Node));Node*pTail=pHead;intfor(i=0;i<n;Node*pNew=(Node*)malloc(sizeof(Node));pNew->val='a'+i;pTail->pNext=pNew;pNew->pNext=NULL;pTail=pNew;}return}Node*p=pHead->pNext;intisFirst=0;while(p!={{}p=p-}}Node*TransNeighbor(Node*pHead){Node*p=pHead->pNext;{charvalue=p-}return}//#defineMAX100intmain(){charinti=0,j=0;;intflag=0;{{{}

{}

}}if(j!=0)flag=1;return0;}#include<stdlib.h> //#definem20typedefcharElemType;typedefstruct{inttop;stacknode*sp;Init(stacknode{return0;}voidPush(stacknode*st,ElemType{printf("Thestackisoverflow!\n");{}}voidPop(stacknode{}{chars[m]="(()";inti;printf("Creatasp=(stacknode*)malloc(sizeof(stacknode)); //printf("Inputa//{}return0;}2.输入一行数字：1234235645875结果即：123423#defineM}int{}intintint{charc='{{}}}printf("%d{return}{mn,MN0补齐。如n=8m=9，{int{char}intintreturn２３将onetwonine}129输入：1Two2输入：DoubleDoubleTwo有空格，字符，两个Double相连，Double位于最后一个单词都错{int{}}else{chartemp[11],c='int}{}}{{return} 不带重复数字的，所以上面的输出是456321和571。如果是负数，比如输入-175，输出-571。int{inta[10]={0},i,flag=0,flag1=0;intlen=strlen(input);{}intlen1=strlen(input);intn[50],temp;

intcount=0;{{}}{{}}

return}２５．编程的时候，if条件里面的“(”、“)”括号经常出现不匹配的情况导致编译不过，请编写程序检测输入一if((a==1))&&(b==1))if语句的最外面至少有一对括号。提示：用堆栈来做。输出：RIGTH33输出：WRONG34int{{char} charintint}int{}{printf("%d}returnelse}{（数值），从数值voidarray_ite(intlen,intinput_array[],intm,intintlenintintput_array[]：输入的初始数列intm：初始计数值intoutput_array[]输入：intinput_array[{3,1,2,4}，intlen4输出：output_array[ incopytoclipboardprint?#include<stdio.h>voidprint_array(intlen,int{for(inti=0;i<len;i++)printf("%d",array[i]);}void te(intlen,intinput_array[],intm,int{intstartPos=0;intoutPos;intnIter=len-1;intnum=len;for(;nIter>=0;nIter--{printf("outPo