Leetcode第四十题组合总和2|C语言

void QuickSort(int *candidates,int left,int right){//快排排序，之后在回溯中便于排除相同的数字
    if(left>right)
        return;       
    int i=left;
    int j=right;
    int key=candidates[i];
    int temp;
    while(i<j){
        while(candidates[j]>=key&&j>i)
            j--;
        while(candidates[i]<=key&&j>i)
            i++;
        if(i<j){
            temp=candidates[i];
            candidates[i]=candidates[j];
            candidates[j]=temp;
        }
    }
    candidates[left]=candidates[i];
    candidates[i]=key;
    QuickSort(candidates,left,i-1);
    QuickSort(candidates,i+1,right);
}

void backtracking(int *sum,int* length,int **result,int *temp,int target,int *returnSize,int** returnColumnSizes,int startindex,int *candidates,int candidatesSize){
//先写出口
    if((*sum)>target)//当前数组收集的几个数的和大于target，直接返回
        return;
    else if((*sum)==target){//如果等于target的话，放进最终要返回的指针数组中
        result[*returnSize]=malloc(sizeof(int)*(*length));为指针数组中第returnSize位指针创建空间
        for(int i=0;i<(*length);i++){//把收集到的数组复制到创建的空间中
            result[*returnSize][i]=temp[i];
        }
        (*returnColumnSizes)[*returnSize]=(*length);
        (*returnSize)++;
        return;
    }else{//如果小于target的话，继续收集
        for(int i=startindex;i<candidatesSize;i++){
            if(i>startindex&&candidates[i]==candidates[i-1])
            //如果当前项与前一项相同，为避免因存在重复数字导致最终结果存在同样的数组
            //直接跳过此次for遍历
                continue;
            temp[*length]=candidates[i];
            (*sum)+=temp[(*length)++];
            backtracking(sum,length,result,temp,target,returnSize,returnColumnSizes,i+1,candidates,candidatesSize);
            (*length)--;
            (*sum)-=temp[*length];
        }   
    }
}


int** combinationSum2(int* candidates, int candidatesSize, int target, int* returnSize, int** returnColumnSizes){
    int** result=(int **)malloc(sizeof(int*)*1000);
    (*returnSize)=0;
    *returnColumnSizes=(int*)malloc(sizeof(int)*1000);
    int* temp=malloc(sizeof(int)*31);
    int sum=0;
    int length=0;
    int k=0;
 
    QuickSort(candidates,0,candidatesSize-1);  
    
    backtracking(&sum,&length,result,temp,target,returnSize,returnColumnSizes,0,candidates,candidatesSize);
    return result;
}