摘要：
int findMin(struct TreeNode *root,int data) { if(!root) return -1; if(root->val > data) return root->val; int left = findMin(root->left,data); int rig 阅读全文
摘要：
bool func(int x){ int temp = x; while(temp){ if(temp % 10 && x % (temp % 10) == 0) temp /= 10; else return false; } return true; } int* selfDividingNu 阅读全文
摘要：
int* findErrorNums(int* nums, int numsSize, int* returnSize){ int* arr = (int*)malloc(2*sizeof(int)); int* hash = (int*)calloc(numsSize,sizeof(int)); 阅读全文
摘要：
int** shiftGrid(int** grid, int gridSize, int* gridColSize, int k, int* returnSize, int** returnColumnSizes){ int** arr = (int**)calloc(gridSize,sizeo 阅读全文
摘要：
char * shortestCompletingWord(char * licensePlate, char ** words, int wordsSize){ char* s = (char *)calloc(strlen(licensePlate),sizeof(char)); int i,j 阅读全文
摘要：
int* shortestToChar(char * S, char C, int* returnSize){ int strLength = strlen(S);//字符串长度 int *arr=(int*)malloc(sizeof(int)*strLength); int prev = -st 阅读全文