摘要：
int comp(void *a,void *b){ return *(int*)a-*(int*)b; } int* getLeastNumbers(int* arr, int arrSize, int k, int* returnSize){ qsort(arr,arrSize,sizeof(i 阅读全文
摘要：
void quick(int* arr,int start,int end) { int left = start; int right = end; int mid = arr[start]; while(left < right) { while(left < right) { if (arr[ 阅读全文
摘要：
int* constructArr(int* a, int aSize, int* returnSize){ int *arr = NULL; int i, temp; if (a == NULL || aSize <= 1) { *returnSize = 0; return a; } *retu 阅读全文
摘要：
. int* maxSlidingWindow(int* nums, int numsSize, int k, int* returnSize){ if (nums == NULL || numsSize == 0){ *returnSize = 0;//传参检查 return NULL; } *r 阅读全文
摘要：
typedef struct { int Data[10000]; int top1; int top2; } CQueue; CQueue* cQueueCreate() { CQueue *newQueue = (CQueue *)malloc(sizeof(CQueue)); newQueue 阅读全文