摘要：
int cmp(const void* a, const void* b){ return *(int*)a - *(int*)b; } void recursion(int* nums, int numsSize, int* returnSize, int* returnColumnSizes, 阅读全文
摘要：
void recursion(int* nums, int numsSize, int* returnSize, int* returnColumnSizes, int cnt, int** arr, int* temp,int* hash){ if (cnt == numsSize){ arr[( 阅读全文
摘要：
char * multiply(char * num1, char * num2){ if(*num1=='0' || *num2=='0') return "0"; int i, j, len1=strlen(num1), len2=strlen(num2),temp, pst=(len1+len 阅读全文
摘要：
int cmp(const void* a,const void* b){ return *(int*)a-*(int*)b; } void recursion(int* candidates,int candidatesSize,int** arr,int* temp,int pst,int ta 阅读全文
摘要：
int cmp(const void* a,const void* b){ return *(int*)a-*(int*)b; } void recursion(int* candidates,int len,int** arr, int* temp, int pst, int target, in 阅读全文