//出現(xiàn)次數(shù)相當(dāng)頻繁 //實(shí)現(xiàn)strcmp函數(shù) int strcmps(char* l,char* r) {//assert(l!=0&&r!=0);while(*l == *r &&*l != '\0')l++,r++;if(*l > *r)return 1;else if(*l == *r)return 0;return -1; } //實(shí)現(xiàn)字符串翻轉(zhuǎn) 不使用strlen函數(shù) char *strrev (char * string) {char *start = string;char *left = string;char ch;//使string指向最后一個(gè)字符while (*string++);string -= 2;// ‘lastchar’ ‘\0’ ‘NULL’while (left < string){ch = *left;*left++ = *string;*string-- = ch;}return(start); } //將一個(gè)單鏈表逆序 void reserve(Node* phead) {Node* p = phead->next;//第一個(gè)節(jié)點(diǎn)if(p == NULL || p->next == NULL)return; //只有頭節(jié)點(diǎn)或一個(gè)節(jié)點(diǎn)Node* p1=p->next;//下一個(gè)節(jié)點(diǎn)p->next=NULL;//新鏈表尾賦空while(p1!=NULL){p = p1->next;//保留鏈表//把新節(jié)點(diǎn)移到開頭p1->next = phead->next;phead->next = p1;//p1重新指向鏈表p1 = p;} } //將一個(gè)數(shù)字字符串轉(zhuǎn)換為數(shù)字."1234" -->1234 int atoii(char* s) {//assert(s!=NULL);int num = 0;while(*s>'0' && *s<'9'){num *= 10;num += *s-'0';s++;}return num; } //實(shí)現(xiàn)任意長度的整數(shù)相加 void bigadd(char* num,char* str,int len) {for(int i=len;i>0;i--){num[i] += str[i];int j = i;while(num[j]>=10){num[j--] -= 10;num[j] += 1;}} } //寫函數(shù)完成內(nèi)存的拷貝 (重點(diǎn)：覆蓋)技巧：循環(huán)展開 void* memcpy( void *dst, const void *src, unsigned int len ) {register char *d;register char *s;if (len == 0)return dst;if ( dst > src ) //考慮覆蓋情況{d = (char *)dst + len - 1;s = (char *)src + len - 1;while ( len >= 4 ) //循環(huán)展開，提高執(zhí)行效率{*d-- = *s--;*d-- = *s--;*d-- = *s--;*d-- = *s--;len -= 4;}while ( len-- ){*d-- = *s--;}}else if ( dst < src ){d = (char *)dst;s = (char *)src;while ( len >= 4 ){*d++ = *s++;*d++ = *s++;*d++ = *s++;*d++ = *s++;len -= 4;}while ( len-- ){*d++ = *s++;}}return dst; }

總結(jié)

以上是生活随笔為你收集整理的面试中经常出现的算法2（整理）的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。