摘要:
char * destCity(char *** paths, int pathsSize, int* pathsColSize){ int col = *pathsColSize; char *cur = paths[0][col-1]; for(int i = 1; i < pathsSize; 阅读全文
摘要:
bool detectCapitalUse(char * word){ bool smallFlag=false; int cnt=0; for(int i=0; i<strlen(word); i++){ if(word[i]>='A' && word[i]<='Z'){ cnt++; if(sm 阅读全文
摘要:
bool containsPattern(int* arr, int arrSize, int m, int k){ for (int i=0; i+m*k <= arrSize; ++i) { bool flag = true; for (int j=i+m; j<i+m*k && flag; j 阅读全文
摘要:
int recursion(struct TreeNode* root, int* max){ if (!root) return 0; int left=recursion(root->left,max); int right=recursion(root->right,max); if(left 阅读全文
摘要:
int distanceBetweenBusStops(int* distance, int distanceSize, int start, int destination){ int dst1=0,dst2=0; int i=start; while(i%distanceSize != dest 阅读全文
摘要:
int distributeCandies(int* candyType, int candyTypeSize){ int cnt=0; int hash[200001]={0}; for (int i=0; i<candyTypeSize; i++){ if (hash[candyType[i]+ 阅读全文
摘要:
int* distributeCandies(int candies, int num_people, int* returnSize){ int i=0; int* arr = (int*)calloc(num_people,sizeof(int)); while(candies>0){ arr[ 阅读全文