LeetCode 40题：组合总和2

题目

给定一个候选人编号的集合 candidates 和一个目标数 target ，找出 candidates 中所有可以使数字和为 target 的组合。

candidates 中的每个数字在每个组合中只能使用 一次 。

注意：解集不能包含重复的组合。 

示例 1:

输入: candidates = [10,1,2,7,6,1,5], target = 8,
输出:
[
[1,1,6],
[1,2,5],
[1,7],
[2,6]
]

示例 2:

输入: candidates = [2,5,2,1,2], target = 5,
输出:
[
[1,2,2],
[5]
]

提示:

• 1 <= candidates.length <= 100
• 1 <= candidates[i] <= 50
• 1 <= target <= 30

---

 

代码

#include<stdio.h>
#include<stdlib.h>
#include<string.h>

int comp(const void *a, const void *b);
int combine(int* candidates, int candidatesSize, int target,int**res,int ind);
int** combinationSum2(int* candidates, int candidatesSize, int target, int* returnSize, int** returnColumnSizes);

int size=0;
int len=0;
int *com;
int *columnsize;

int main()
{
    int candidates[5] = {2,5,2,1,2}, target = 5;
    int*t=(int*)malloc(sizeof(int)),**te=(int**)malloc(sizeof(int*));
    int**res=combinationSum2(candidates,5,target,t,te);
    printf("\n");
    for(int i=0;i<*t;i++)
    {
        for(int j=0;j<te[0][i];j++)
        {
            printf("%d ",res[i][j]);
        }
        printf("\n");
    }
    return 0;
}

int comp(const void *a, const void *b) 
{ 
    return *(int *)a - *(int *)b; 
}

int** combinationSum2(int* candidates, int candidatesSize, int target, int* returnSize, int** returnColumnSizes)
{
    qsort(candidates, candidatesSize, sizeof(int), comp);
    int**res=(int**)malloc(sizeof(int*)*10);
    columnsize=(int*)malloc(sizeof(int)*10);
    com=(int*)malloc(sizeof(int)*10);
    if(candidates[0]>target)
    {
        *returnSize=0;
        returnColumnSizes[0][0]=0;
        return NULL;
    }
    int t=combine(candidates,candidatesSize, target,res,0);
    *returnSize=size;
    returnColumnSizes[0]=columnsize;
    return res;
}

int combine(int* candidates, int candidatesSize, int target,int**res,int ind)
{
    if(target<0)
    {
        return 1;
    }
    else if(target==0)
    {
        size++;
        columnsize[size-1]=len;
        int*temp=(int*)malloc(sizeof(int)*len);
        for(int i=0;i<len;i++)
        {
            temp[i]=com[i];
        }
        res[size-1]=temp;
        return 1;
    }
    else{
        for(int i=ind;i<candidatesSize;i++)
        {
            len++;
            com[len-1]=candidates[i];
            int sign=combine(candidates,candidatesSize,target-candidates[i], res,i+1);   
            while(i+1<candidatesSize&&candidates[i+1]==candidates[i])
            {
                i++;
            }
            len--;         
            if(sign==1)
            {
                break;
            }
        }
    }
    return 0;
}