LeetCode：216. 组合总和 III

/**
 * Return an array of arrays of size *returnSize.
 * The sizes of the arrays are returned as *returnColumnSizes array.
 * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free().
 */
 //定义路径
int *path;
int pathSize;
//定义一个二维数组记录结果
int **ans;
int ansSize;
//求和
int sumup(int *arr,int Size){
    int sum=0;
    for(int i=0; i<Size; i++){
        sum=sum+arr[i];
    }
    return sum;
}
//回溯算法
void backtracking(int n,int k,int start){
    if(pathSize == k && sumup(path,pathSize) == n){
        int *tmp = malloc(sizeof(int) * pathSize);
        for(int i = 0;i < pathSize;i++){
            tmp[i] = path[i];
        }
        ans[ansSize++] = tmp;
        return;
    }
    //递归回溯
    for(int i = start;i <= 9;i++){
        path[pathSize++] = i;
        backtracking(n,k,i + 1);
        pathSize--;
    }
}
int** combinationSum3(int k, int n, int* returnSize, int** returnColumnSizes){
    path = (int*)malloc(sizeof(int) * 2000);
    ans = (int**)malloc(sizeof(int*) * 2000);
    pathSize = ansSize = 0;
    //回溯
    backtracking(n,k,1);
    //返回大小为ans数组大小
    *returnSize = ansSize;
    *returnColumnSizes = (int*)malloc(sizeof(int) *(*returnSize));
    for(int i = 0;i < *returnSize;i++){
        (*returnColumnSizes)[i] = k;
    }
    return ans;
}