摘要：
char* reverseLeftWords(char* s, int n){ if (n == 0) return s; int len = strlen(s); char* str = (char*)calloc(len+1,sizeof(char));//多一个字节后面放'\0'结束 n %= 阅读全文
摘要：
int Mycmp(const void* a,const void* b) { return *(int*)a - *(int*)b; } bool isStraight(int* nums, int numsSize){ qsort(nums,numsSize,sizeof(int),Mycmp 阅读全文
摘要：
int* printNumbers(int n, int* returnSize){ if (n == 0) return NULL; *returnSize = pow(10,n) - 1; int* arr = (int*)calloc(*returnSize,sizeof(int)); for 阅读全文
摘要：
int cmp_up(void *a, void *b) { return *(int *)a - *(int *)b; } int majorityElement(int *nums, int numsSize) { qsort(nums, numsSize, sizeof(int), cmp_u 阅读全文
摘要：
int findRepeatNumber(int* nums, int numsSize){ int max = nums[0]; for (int j = 1; j<numsSize; j++) { if (nums[j] > max) max = nums[j]; } int *hash = ( 阅读全文
摘要：
int fib(int n){ if (n == 0) return 0; if (n == 1 || n == 2) return 1; int pre=1; int prepre=1; int curr = 0; for (int i=3; i <= n; i++) { curr = (pre 阅读全文
摘要：
int minArray(int* numbers, int numbersSize){ int min = numbers[0]; for (int i=1; i<numbersSize; i++) { if (numbers[i]<min) min = numbers[i]; } return 阅读全文