嵌入式工程师面试题--经典.doc

《嵌入式工程师面试题--经典.doc》由会员上传分享，免费在线阅读，更多相关内容在行业资料-天天文库。

1、1、将一个字符串逆序2、将一个链表逆序3、计算一个字节里（byte）里面有多少bit被置14、搜索给定的字节(byte)5、在一个字符串中找到可能的最长的子字符串6、字符串转换为整数7、整数转换为字符串style="MARGIN:0px;COLOR:rgb(102,102,102);LINE-HEIGHT:150%"wrap="break-word"1、char*strconv(char*p){inti,length;chartemp;length=strlen(p);for(i=0;i

2、h-1-i);*(p+length-1-i)=temp;}returnp;}intmain(){charsrc[100];char*p;scanf("%s",src);p=strconv(src);printf("%s",p);return0;}style="MARGIN:0px;COLOR:rgb(102,102,102);LINE-HEIGHT:150%"wrap="break-word"3、intcal(intdata)//calculationthenumberofbitinonebyte{inta;intcount=0;a=data%100;while(a!

3、=0){count+=a%2;a/=2;}returncount;}intmain(){intd,count;scanf("%d",&d);count=cal(d);printf("%dofone",count);return0;}style="MARGIN:0px;COLOR:rgb(102,102,102);LINE-HEIGHT:150%"wrap="break-word"4、#include#includevoidfindmax(char*p){intj=0,max=0;intcount=0;charrecord[200]

4、;charrecordmax[200];for(inti=0;;i++){if((*(p+i)=='')

5、

6、(*(p+i)=='')){if(count>max){max=count;record[j]='';strcpy(recordmax,record);}count=0;j=0;}else{record[j]=*(p+i);count++;j++;}if(*(p+i)=='')break;}printf("%s",recordmax);}intmain(){charstr[]="zengweidsfdsaflangdhah";printf("%s

7、",str);findmax(str);return0;}style="MARGIN:0px;COLOR:rgb(102,102,102);LINE-HEIGHT:150%"wrap="break-word"#include#include#includetypedefstructshopping{chargoods[100];structshopping*next;}SHOP;SHOP*buildlink()//创建链表{chargoods[100];SHOP*head,*p,*h;p=(SHOP*)malloc

8、(sizeof(SHOP));head=p;head->next=NULL;printf("Inputthreegoods:");for(inti=0;i<3;i++){scanf("%s",goods);p=(SHOP*)malloc(sizeof(SHOP));strcpy(p->goods,goods);p->next=NULL;if(head->next==NULL){head->next=p;h=p;}else{h->next=p;h=h->next;}}returnhead;}voidshowlink(SHOP*head)//显示链表{SHOP*p;p=hea

9、d->next;while(p!=NULL){printf("%s",p->goods);p=p->next;}printf("");}SHOP*revlink(SHOP*head)//反转链表{SHOP*p,*newp;p=head->next;head->next=NULL;while(p!=NULL){newp=p;p=p->next;newp->next=head->next;head->next=newp;}returnhead;}intdelnode(SHOP*head,char*str){//deletesu