216. 组合总和 III C语言实现（回溯法 宽度优先）

int** combinationSum3(int num, int target, int** columnSizes, int* returnSize) {
    int candidates[]={1,2,3,4,5,6,7,8,9};
    if(target<candidates[0])return NULL;
    int len=200;//满n叉树的叶子数
    int **a=(int **)calloc(len,sizeof(int *)),**b=(int **)calloc(len,sizeof(int *)),**tmp=NULL;
    int **res=(int **)calloc(len,sizeof(int *));
    *columnSizes=(int *)calloc(len,sizeof(int));
    for(int j=0;j<len;j++){
         a[j]=(int *)calloc(num+2,sizeof(int));
	     b[j]=(int *)calloc(num+2,sizeof(int));
    }
	int count=1,cc=0;
    for(int temp=0;temp<num;temp++){ 
        for (int k=0;k<count;k++)
        {
			for (int l=a[k][num]+(temp==0?0:1);l<9;l++)
			{
                if((a[k][num+1]+candidates[l])>target||(temp<num-1&&(a[k][num+1]+candidates[l])==target))break;                
                if(temp==num-1&&(a[k][num+1]+candidates[l])==target){
                   (*columnSizes)[(*returnSize)]=num;
                    res[(*returnSize)]=(int*)calloc(num,sizeof(int));
                    memcpy(res[(*returnSize)],a[k],sizeof(int)*(temp));
                    res[(*returnSize)++][temp]=candidates[l];
                }
                if(temp<num-1&&(a[k][num+1]+candidates[l])<target) {
                    int sum=0;
                    for(int i=0;i<num-temp-1;i++)sum+=candidates[i];
                    if(target-(a[k][num+1]+candidates[l])<sum)continue;
                    memcpy(b[cc],a[k],sizeof(int)*(temp));
                    b[cc][num+1]=a[k][num+1]+candidates[l];
                    b[cc][num]=l;
				    b[cc++][temp]=candidates[l];
                }
			}
        }
        if(cc==0)break;
		count=cc;cc=0;tmp=a;a=b;b=tmp;
    }
    return res;   
}