摘要:
int maxLengthBetweenEqualCharacters(char * s){ int maxLen = -1; int tmpLen = -1; int hash[128]; if (s == NULL || strlen(s) < 2) return -1; // 初始化字典值 m 阅读全文
摘要:
int maxDepth(char * s){ int cnt=0,max=0; for(int i=0; s[i]!='\0'; i++){ if(s[i]=='('){ cnt++; if(cnt>max) max=cnt; } else if(s[i]==')') cnt--; } retur 阅读全文
摘要:
int cmp(const void* a,const void* b){ return *(int*)a-*(int*)b; } double trimMean(int* arr, int arrSize){ qsort(arr,arrSize,sizeof(int),cmp); int num= 阅读全文
摘要:
void recursion(struct TreeNode* root, int* minDeep, int curDeep){ curDeep++; if (curDeep>=*minDeep) return; if (!root->left && !root->right) { if (cur 阅读全文
摘要:
char * reorderSpaces(char * text){ int i,spaceNum=0,mid=0,end=0,wordNum=0; int len=strlen(text); for (i=0; i<len; i++){ if (text[i]==' ') { if (i!=0 & 阅读全文
摘要:
char slowestKey(int* releaseTimes, int releaseTimesSize, char * keysPressed){ int arr[][2]={keysPressed[0],releaseTimes[0]}; for (int i=1; i<releaseTi 阅读全文
摘要:
/** * Note: The returned array must be malloced, assume caller calls free(). */ typedef struct st{ int val; int cnt; }st; int cmp(const void* a,const 阅读全文