摘要：
int* answer; int answerSize; int base, count, maxCount; void update(int x) { if (x == base) { ++count; } else { count = 1; base = x; } if (count == ma 阅读全文
摘要：
int* sumZero(int n, int* returnSize){ int* arr= (int*)calloc(n,sizeof(int)); int i,pst=0; for (i=1; i<=n/2; i++) { arr[pst++]=i; arr[pst++]=-i; } *ret 阅读全文
摘要：
int findNumbers(int* nums, int numsSize){ int i,cnt,total=0,val; for (i=0; i<numsSize; i++) { val=nums[i]; cnt=0; while(val){ cnt++; val /=10; } if (c 阅读全文
摘要：
int pivotIndex(int* nums, int numsSize){ int i,total=0,sum=0; for (i=0; i<numsSize; i++) total+=nums[i]; for (i=0; i<numsSize; i++){ if (sum*2 + nums[ 阅读全文
摘要：
int** findSolution(int (*customFunction)(int, int), int z, int* returnSize, int** returnColumnSizes) { int** arr = (int**)calloc(z,sizeof(int*)); *ret 阅读全文
摘要：
char nextGreatestLetter(char* letters, int lettersSize, char target){ for (int i=0; i<lettersSize; i++) if (letters[i] > target) return letters[i]; re 阅读全文
摘要：
char * tictactoe(int** moves, int movesSize, int* movesColSize){ int hash[2][8]={0},i; char* s[] = {"A","B"}; for (i=0; i<movesSize; i++) { //累计行子 has 阅读全文