精品试题的资料算法.docVIP

写一个函数比较两个字符串str1和str2的大小，若相等返回0，若str1大于 str2返回1，若str1小于str2返回－1 int strcmp ( const char * src,const char * dst) { int ret = 0 ; while( ! (ret = *(unsigned char *)src - *(unsigned char *)dst) *dst) { ++src; ++dst; } if ( ret 0 ) ret = -1 ; else if ( ret 0 ) ret = 1 ; return( ret ); } 3,求1000！的未尾有几个0（用素数相乘的方法来做，如72=2*2*2*3*3）; 求出1-1000里,能被5整除的数的个数n1,能被25整除的数的个数n2,能被125整除的数的个数n3, 能被625整除的数的个数n4. 1000!末尾的零的个数=n1+n2+n3+n4; #includestdio.h #define NUM 1000 int find5(int num){ int ret=0; while(num%5==0){ num/=5; ret++; } return ret; } int main(){ int result=0; int i; for(i=5;i=NUM;i+=5) { result+=find5(i); } printf( the total zero number is %d\n,result); return 0; } 1. 有双向循环链表结点定义为： struct node { int data; struct node *front,*next; }; 有两个双向循环链表A，B，知道其头指针为：pHeadA,pHeadB，请写一函数将两链表中data值相同的结点删除 BOOL DeteleNode(Node *pHeader, DataType Value) { if (pHeader == NULL) return; BOOL bRet = FALSE; Node *pNode = pHead; while (pNode != NULL) { if (pNode-data == Value) { if (pNode-front == NULL) { pHeader = pNode-next; pHeader-front = NULL; } else { if (pNode-next != NULL) { pNode-next-front = pNode-front; } pNode-front-next = pNode-next; } Node *pNextNode = pNode-next; delete pNode; pNode = pNextNode; bRet = TRUE; //不要break或return, 删除所有 } else { pNode = pNode-next; } } return bRet; } void DE(Node *pHeadA, Node *pHeadB) { if (pHeadA == NULL || pHeadB == NULL) { return; } Node *pNode = pHeadA; while (pNode != NULL) { if (DeteleNode(pHeadB, pNode-data)) { if (pNode-front == NULL) { pHeadA = pNode-next; pHeadA-front = NULL; } else { pNode-front-next = pNode-next; if (pNode-next != NULL) { pNode-next-front = pNode-front; } } Node *pNextNode = pNode-next; delete pNode; pNode = pNextNode; } else { pNode = pNode-next; } } } 2. 编程实现：找出两个字符串中最大公共子字符串,如abccade,dgcadde的最大子串为cad int GetCommon(char *s1, char *s2, char **r1, char **r2) { int len1 = strlen(s1); int len2 = strlen(s2); int maxlen