# 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().
 */

void backtrace(int **result, int *returnSize, int **returnColumnSizes, int *tmp, int *tmpSize, int *nums, int startIndex, int numsSize, int k)
{
    if((*tmpSize) == k)
    {
        (*returnColumnSizes)[(*returnSize)] = k;
        memcpy(result[(*returnSize)++], tmp, sizeof(int) * k);
        return;
    }
    int i;
    for(i = startIndex; i<numsSize; ++i)
    {
        tmp[(*tmpSize)++] = nums[i];
        backtrace(result, returnSize, returnColumnSizes, tmp, tmpSize, nums, i+1, numsSize,k);
        (*tmpSize)--;
    }
    return;
}
int** subsets(int* nums, int numsSize, int* returnSize, int** returnColumnSizes){
    *returnSize = 0;
    int resLen = pow(2, numsSize);
    int **result = (int **)malloc(sizeof(int *) * resLen);
    *returnColumnSizes = (int *)malloc(sizeof(int) * resLen);
    memset(*returnColumnSizes, 0, sizeof(int) * resLen);
    int i;
    for(i = 0; i<resLen; i++)
    {
        result[i] = (int *)malloc(sizeof(int) * numsSize);
        memset(result[i], 0, sizeof(int) * numsSize);
    }
    
    int *tmp = (int *)malloc(sizeof(int) * numsSize);
    memset(tmp, 0, sizeof(int) * numsSize);
    int tmpSize = 0;
    for(i = 0; i<=numsSize; i++)
    {
        backtrace(result, returnSize, returnColumnSizes, tmp, &tmpSize, nums, 0, numsSize, i);
    }
    free(tmp);
    return result;
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值