LeetCode：78. 子集

/**
 * 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* length;
//回溯算法
void backtracking(int* nums,int numsSize,int start){
    //收集子集
    int* temp = (int*)malloc(sizeof(int) * pathSize);
    for(int i = 0;i < pathSize;i++){
        temp[i] = path[i];
    }
    ans = (int**)realloc(ans,sizeof(int*) * (ansSize + 1));
    length[ansSize] = pathSize;
    ans[ansSize++] = temp;
    //结束递归回溯
    if(start >= numsSize){
        return;
    }
    //回溯
    for(int i = start;i < numsSize;i++){
        path[pathSize++] = nums[i];
        backtracking(nums,numsSize,i + 1);
        //回溯
        pathSize--;
    }
}
int** subsets(int* nums, int numsSize, int* returnSize, int** returnColumnSizes){
    //初始化
    path = (int*)malloc(sizeof(int) * numsSize);
    ans = (int**)malloc(0);
    length = (int*)malloc(sizeof(int) * 1500);
    ansSize = pathSize = 0;
    //进入回溯
    backtracking(nums, numsSize, 0);
    
    *returnSize = ansSize;//返回子集个数个数
    *returnColumnSizes = (int*)malloc(sizeof(int) * ansSize);//每个子集长度
    for(int i = 0; i < ansSize; i++) {
        (*returnColumnSizes)[i] = length[i];
    }
    return ans;
}