給你一個整數數組?nums?，數組中的元素?互不相同?。返回該數組所有可能的子集（冪集）。

解集?不能?包含重復的子集。你可以按?任意順序?返回解集。

思路一：回溯

void backtracking(int* nums, int numsSize, int** res, int* returnSize, int** returnColumnSizes, int* path, int pathSize, int startIndex) {res[*returnSize] = (int*)malloc(sizeof(int) * pathSize);memcpy(res[*returnSize], path, sizeof(int) * pathSize);(*returnColumnSizes)[*returnSize] = pathSize;(*returnSize)++;for (int i = startIndex; i < numsSize; i++) {path[pathSize] = nums[i];backtracking(nums, numsSize, res, returnSize, returnColumnSizes, path, pathSize + 1, i + 1);}
}int** subsets(int* nums, int numsSize, int* returnSize, int** returnColumnSizes) {*returnSize = 0;*returnColumnSizes = (int*)malloc(sizeof(int) * 10001);int** res = (int**)malloc(sizeof(int*) * 10001);int* path = (int*)malloc(sizeof(int) * numsSize);backtracking(nums, numsSize, res, returnSize, returnColumnSizes, path, 0, 0);return res;
}

分析：

本題與上一題相似，利用回溯算法將數組內子集全部列出即可，path[pathSize] = nums[i];

backtracking(nums, numsSize, res, returnSize, returnColumnSizes, path, pathSize + 1, i + 1);將子集全部列出，最后返回res

總結：

本題考察回溯的應用，將子集按順序全部列出即可解決