嵌入式工程师面试题--经典(共3篇).docVIP

嵌入式工程师面试题--经典(共3篇) 回目录 1、将一个字符串逆序2、将一个链表逆序3、计算一个字节里（byte）里面有多少bit被置14、搜索给定的字节(byte)5、在一个字符串中找到可能的最长的子字符串6、字符串转换为整数7、整数转换为字符串style=quot;MARGIN:0px;COLOR:rgb(102,102,102);LINE-HEIGHT:150%quot;wrap=quot;break-wordquot;1、char*strconv(char*p) { inti,length; chartemp; length=strlen(p); for(i=0;ilt;length/2;i++) { temp=*(p+i); *(p+i)=*(p+lengthi); *(p+lengthi)=temp; } returnp; } intmain() { charsrc[100]; char*p; scanf(quot;%squot;,src); p=strconv(src); printf(quot;%s\nquot;,p); return0; } style=quot;MARGIN:0px;COLOR:rgb(102,102,102);LINE-HEIGHT:150%quot;wrap=quot;break-wordquot;3、intcal(intdata) //calculationthenumberofbitinonebyte { inta; intcount=0; a=data%100; while(a!=0) { count+=a%2; a/=2; } returncount; } intmain() { intd,count; scanf(quot;%dquot;,amp;d); count=cal(d); printf(quot;%dofone\nquot;,count); return0; } style=quot;MARGIN:0px;COLOR:rgb(102,102,102);LINE-HEIGHT:150%quot;wrap=quot;break-wordquot;4、#includelt;stdio.hgt; #includelt;string.hgt; voidfindmax(char*p) { intj=0,max=0; intcount=0; charrecord[200]; charrecordmax[200]; for(inti=0;;i++) { if((*(p+i)==#39;#39;)||(*(p+i)==#39;\0#39;)) { if(countgt;max) { max=count; record[j]=#39;\0#39;; strcpy(recordmax,record); } count=0; j=0; } else { record[j]=*(p+i); count++; j++; } if(*(p+i)==#39;\0#39;) break; } printf(quot;%s\nquot;,recordmax); } intmain() { charstr[]=quot;zengweidsfdsaflangdhahquot;; printf(quot;%s\nquot;,str); findmax(str); return0; } style=quot;MARGIN:0px;COLOR:rgb(102,102,102);LINE-HEIGHT:150%quot;wrap=quot;break-wordquot;#includelt;stdio.hgt; #includelt;stdlib.hgt; #includelt;string.hgt; typedefstructshopping { chargoods[100]; structshopping*next; }SHOP; SHOP*buildlink()//创建链表 { chargoods[100]; SHOP*head,*p,*h; p=(SHOP*)malloc(sizeof(SHOP)); head=p; head-gt;next=NULL; printf(quot;Inputthreegoods:quot;); for(inti=0;ilt;3;i++) { scanf(quot;%squot;,goods); p=(SHOP*)malloc(sizeof(SHOP)); strcpy(p-gt;goods,goods); p-gt;next=NULL; if(head-gt;next==NULL) { head-gt;next=p; h=p; } else { h-