摘要:
int* kWeakestRows(int** mat, int matSize, int* matColSize, int k, int* returnSize){ int** arr = (int**)calloc(*matColSize+1,sizeof(int*)); int* hash = 阅读全文
摘要:
int Max(int a,int b){ return (a>b)?a:b; } int massage(int* nums, int numsSize){ if(numsSize==0) return 0; if(numsSize==1) return nums[0]; int *dp=(int 阅读全文
摘要:
int thirdMax(int* nums, int numsSize){ long long first = -2147483649; long long second = -2147483649; long long third = -2147483649; for (int i=0; i<n 阅读全文