1)sizeof相关系列问题2)const相关系列问题3)大量林锐书的习题，以及各种变种这三个几乎是每次必出现下面的这些是程序相关题,很多都是以前有讨论过的,还请各位大侠能整理个比较适合做面试时答案的解答,多谢了.最好能给出讨论链接,让我等后辈有的机会.1)求出相似度的算法.2)写出二分查找的代码.int binary_search(int* arr, int key, int n){ int low = 0; int high = n – 1; int mid; while (low <= high) { mid = (high + low) / 2; if (arr[mid] > k) high = mid – 1; else if (arr[mid] < k) low = mid + 1; else return mid; } return -1;} 3)写出在母串中查找子串出现次数的代码.*4)写出快速排序或者某种排序算法代码出现次数相当频繁5)写出查找从一个集合中输出所有子集合的算法.*6)实现strcpy函数char* strcpy(char* dest, const char* src){ assert((dest != NULL) && (src != NULL)); char* address = dest; while (‘/0’ != (*dest++ = *src++)); return address;}出现次数相当频繁*7)实现strcmp函数int mystrcmp(const char* str1, const char* str2){ assert((str1 != NULL) && (str2 != NULL)); int ret = 0; while (!(ret = *(unsigned char*)str1 – *(unsigned char*)str2) && *str2) { str1++; str2++; } if (ret > 0) ret = 1; else if (ret < 0) ret = -1; return ret;} 出现次数相当频繁8)将一个单链表逆序struct test{ int number; double score; test* next;}void reverse(test*& head){ test* pe = head; test* ps = head->next; while(ps != NULL) { pe->next = ps->next; ps->next = head; head = ps; ps = pe->next; }} 9)循环链表的节点对换和删除。*10)将一个数字字符串转换为数字."1234" –>1234＃i nclude<iostream>using namespace std;
，最好的感觉就是你什么都跟我说。
