腾讯2014校园招聘C语言笔试题.docx

《腾讯2014校园招聘C语言笔试题.docx》由会员分享，可在线阅读，更多相关《腾讯2014校园招聘C语言笔试题.docx（8页珍藏版）》请在淘文阁 - 分享文档赚钱的网站上搜索。

1、1.输入一个链表的头结点，从尾到头反过去输入每个结点的值。链表结点界说如下：structListNodeintm_nKey;ListNode*m_pNext;A:递归办法逆序输入，栈办法逆序输入。(恣意完成一种既可)voidPrintListUsingRecursicve(pListNodehead)if(head!=NULL)PrintListUsingRecursicve(head-m_pNext);printf(%d/n,head-m_nKey);voidPrintListUsingStack(pListNodehead)Stacks;s.top=0;pListNodep=head;do

2、push(&s,p-m_nKey);p=p-m_pNext;while(p!=NULL);while(!IsEmpty(&s)printf(%d/n,pop(&s);2.二元树的深度标题：输入一棵二元树的根结点，求该树的深度。从根结点到叶结点顺次通过的结点含根、叶结点构成树的一条途径，最长途径的长度为树的深度。#include#include#include#include#defineMAXLEN100#defineMAXNUM10typedefintTreeMAXLEN;Treebt;intGetDeep(inti)intl=0,r=0;if(bti*2!=-1)l=GetDeep(i*2

3、)+1;if(bti*2+1!=-1)r=GetDeep(i*2+1)+1;returnlr?l:r;intmain()inti=0;memset(bt,-1,sizeof(bt);for(i=1;i1);returnresult;4.从上往下遍历二元树标题：输入一颗二元树，从上往下按层打印树的每个结点，统一层中依照从左往右的次序打印。先序，中序，后序三种方法完成假如从上往下，从左到右的话只要一种遍历的方法：广度优先遍历。#include#include#include#include#defineMAXLEN100#defineMAXNUM10typedefintTreeMAXLEN;Tre

4、ebt;typedefstructqueueintbegin,end;intspaceMAXLEN;Queue;intmain()inti=0;memset(bt,-1,sizeof(bt);for(i=1;i=MAXNUM;i+)bti=i;Queueqe;qe.begin=0;qe.end=0;qe.spaceqe.end+=bt1;while(qe.begin!=qe.end)if(bt2*qe.spaceqe.begin!=-1)/lchildqe.spaceqe.end+=bt2*qe.spaceqe.begin;if(bt2*qe.spaceqe.begin+1!=-1)/rchi

5、ldqe.spaceqe.end+=bt2*qe.spaceqe.begin+1;qe.begin+;printf(-/n);for(i=0;iqe.end;i+)printf(%d,qe.spacei);return0;先序，中序，后序三种方法的只是遍历二元树typedefintTreeMAXLEN;Treebt;voidPreOrderTraverse(inti)if(bti=-1)return;printf(%d,bti);PreOrderTraverse(i*2);/lchildPreOrderTraverse(i*2+1);/rchildvoidInOrderTraverse(int

6、i)if(bti=-1)return;InOrderTraverse(i*2);/lchildprintf(%d,bti);InOrderTraverse(i*2+1);/rchildvoidPostOrderTraverse(inti)if(bti=-1)return;PostOrderTraverse(i*2);/lchildPostOrderTraverse(i*2+1);/rchildprintf(%d,bti);intmain()inti=0;memset(bt,-1,sizeof(bt);for(i=1;i0&p1!=NULL)p1=p1-m_pNext;if(p1=NULL)re

7、turn0;elsewhile(p1!=NULL)p1=p1-m_pNext;p2=p2-m_pNext;returnp2-m_nKey;6.求三角形面积给出三角形的三个边长为a、b、c，求三角形的面积。留意思索是不是三角形doubleGetArea(inta,intb,intc)if(a-b=c|a+b=c)return-0.1;elsedoubles=0.5*(a+b+c);doublearea=sqrt(s*(s-a)*(s-b)*(s-c);returnarea;7.紧缩字符串比方字串aaabbbbccccc，转换成相邻字符+个数的方法紧缩，成为a3b4c5。假如有10个数一样假定需求

8、思索解紧缩char*MergeString(constchar*ch)char*s=(char*)malloc(sizeof(ch);if(s!=NULL)intlen=strlen(ch),i=0,j=0,k=0;for(;im_pNext;while(p1!=NULL)if(p1=head)return1;elsep1=p1-m_pNext;return0;9.推断一个字符串能否对称。aabbaa,efffe前往trueaabac前往falseintSymmetricString(constchar*ch)intlen=strlen(ch);inti=0,j=len-1;if(len%2!

9、=0)return0;for(i=0,j=len-1;i=len/2;i+,j-)if(chi!=chj)return0;return1;10.推断一个字符串能否是另一个字符串的字串intnext20;voidget_next(constchar*T,intnext)inti=0,j=-1;next0=-1;intlen=strlen(T);while(ilen)if(j=-1|Ti=Tj)+i;+j;nexti=j;elsej=nextj;intindex_KMP(constchar*S,constchar*T)inti=0,j=0;get_next(T,next);intlens=strl

10、en(S),lent=strlen(T);while(ilens&j=lent)returni-lent;elsereturn-1;链表的界说，栈的界说：typedefstructstackinttop;intspaceMAXLEN+1;Stack;intpush(Stack*s,intnum)if(s-top=sizeof(s-space)/sizeof(int)return-1;/Errors-spaces-top+=num;returnnum;intpop(Stack*s)if(s-topspace-s-top;intIsEmpty(Stack*s)returns-top=0;typed

11、efstructListNodeintm_nKey;structListNode*m_pNext;ListNode,*pListNode;pListNodeCreateList()srand(unsignedlong)time(NULL);pListNodehead,p1,p2;head=(pListNode)malloc(sizeof(ListNode);p1=head;p2=p1;inti=MAXLEN;while(i-)p2=(pListNode)malloc(sizeof(ListNode);p2-m_nKey=rand()*rand()%(MAXLEN*rand();p1-m_pNext=p2;p1=p2;p2-m_pNext=NULL;returnhead;voidPrintList(pListNodehead)pListNodep=head;doprintf(%d/n,p-m_nKey);p=p-m_pNext;while(p!=NULL);