摘要:
char * toGoatLatin(char * S){ char* buffer; char* retStr = (char*)calloc(2000,sizeof(char)); char* vowel = "aeiouAEIOU"; int pst=0,i,count=1; buffer = 阅读全文
摘要:
char *gcdOfStrings(char *str1, char *str2) { //if (strstr(str1, str2) == NULL && strstr(str2, str1) == NULL) 原答案 //如果最大公因子有的话,那必定是有一个包含其中一个,实际就是长的包含短的 阅读全文
摘要:
int cmpChar(const void *a, const void *b) { return *(char *)a - *(char *)b; } int cmpStr(const void *a, const void *b) { return strcmp(*(char **)a, *( 阅读全文
摘要:
int guessNumber(int n){ int num = 1+(n-1)/2; int left=1,right=n; while(1) { int ret = guess(num); if(ret == 1) left=num+1; else if(ret == -1) right=nu 阅读全文
摘要:
int game(int* guess, int guessSize, int* answer, int answerSize){ int count=0; for (int i=0; i<3; i++) if (guess[i]==answer[i]) count++; return count; 阅读全文
摘要:
int hammingDistance(int x, int y){ x = x^y; int num=0; while(x){ num += x & 1; x >>=1; } return num; } 阅读全文