摘要：
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= 阅读全文
posted @ 2020-11-09 11:47
温暖了寂寞
阅读(91)
评论(0)
推荐(0)
摘要：
void recursion(struct TreeNode* root, int* minDeep, int curDeep){ curDeep++; if (curDeep>=*minDeep) return; if (!root->left && !root->right) { if (cur 阅读全文
posted @ 2020-11-09 11:37
温暖了寂寞
阅读(81)
评论(0)
推荐(0)
摘要：
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 & 阅读全文
posted @ 2020-11-09 10:42
温暖了寂寞
阅读(147)
评论(0)
推荐(0)
摘要：
char slowestKey(int* releaseTimes, int releaseTimesSize, char * keysPressed){ int arr[][2]={keysPressed[0],releaseTimes[0]}; for (int i=1; i<releaseTi 阅读全文
posted @ 2020-11-09 09:23
温暖了寂寞
阅读(93)
评论(0)
推荐(0)
摘要：
/** * 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 阅读全文
posted @ 2020-11-09 00:54
温暖了寂寞
阅读(263)
评论(0)
推荐(0)
浙公网安备 33010602011771号