leetcode 77. 组合 C语言

给定两个整数 n 和 k，返回 1 ... n 中所有可能的 k 个数的组合。

示例:

输入: n = 4, k = 2
输出:
[
  [2,4],
  [3,4],
  [2,3],
  [1,2],
  [1,3],
  [1,4],
]

/**
 * 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 backtracking(int n, int k, int pos, int index, int *temp, int **return_combine, int *returnSize)
{
    int i = 0;
    if (k == 0) {
        return_combine[*returnSize] = (int*)malloc(sizeof(int) * index);
        for (i = 0; i < index; i++) {
            return_combine[*returnSize][i] = temp[i];
        }
        (*returnSize)++;
        return;
    }

    for (i = pos; i <= n - k + 1; i++) {
        temp[index] = i;
        backtracking(n, k - 1, i + 1, index + 1, temp, return_combine, returnSize);
    }
}

int** combine(int n, int k, int* returnSize, int** returnColumnSizes){
    int i =0;
    int *temp = (int*)malloc(sizeof(int) * k);
    int **return_combine = (int**)malloc(sizeof(int*) * 10000);
    *returnSize = 0;
    backtracking(n, k, 1, 0, temp, return_combine, returnSize);
    *returnColumnSizes = (int*)malloc(sizeof(int) * (*returnSize));
    for (i = 0; i < (*returnSize); i++) {
        (*returnColumnSizes)[i] = k;
    }
    return return_combine;
}