int cmpfunc (const void * a, const void * b){return ( *(int*)a - *(int*)b );}
int** combinationSum2(int* candidates, int candidatesSize, int target, int** columnSizes, int* returnSize) {
if(candidatesSize<=0)return NULL;
qsort(candidates,candidatesSize,sizeof(int),cmpfunc);
if(target<candidates[0])return NULL;
int size=target/candidates[0],len=100;//最有可能大的列宽,满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(size+2,sizeof(int));
b[j]=(int *)calloc(size+2,sizeof(int));
}
int count=1,cc=0;
for(int temp=0;temp<size;temp++){
for (int k=0;k<count;k++)
{
for (int l=a[k][size]+(temp==0?0:1);l<candidatesSize;l++)
{
if((a[k][size+1]+candidates[l])>target)break;
if((a[k][size+1]+candidates[l])==target){
(*columnSizes)[(*returnSize)]=temp+1;
res[(*returnSize)]=(int*)calloc(temp+1,sizeof(int));
memcpy(res[(*returnSize)],a[k],sizeof(int)*(temp));
res[(*returnSize)++][temp]=candidates[l];
}
else {
if(target-(a[k][size+1]+candidates[l])<candidates[0])continue;
memcpy(b[cc],a[k],sizeof(int)*(temp));
b[cc][size+1]=a[k][size+1]+candidates[l];
b[cc][size]=l;
b[cc++][temp]=candidates[l];
}
int i=l;
while(candidates[++i]==candidates[l]);
l=i-1;
}
}
if(cc==0)break;
count=cc;cc=0;tmp=a;a=b;b=tmp;
}
return res;
}