LeetCode：77. 组合

/**
 * 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;
//回溯算法
void backtracking(int n,int k,int start){
    if(pathSize == k){
        int* tmp = (int*)malloc(sizeof(int) * k);//防止地址随回溯发生变化
        for(int i = 0;i < k;i++){
            tmp[i] = path[i];
        }
        ans[ansSize++] = tmp;
        return;
    }
    for(int j = start;j <= n;j++){
        path[pathSize++] = j;//当前节点放入路径数组
        backtracking(n, k, j + 1);//递归
        pathSize--;//回溯弹出
    }
}
int** combine(int n, int k, int* returnSize, int** returnColumnSizes){
    path = (int*)malloc(sizeof(int) * k);
    ans = (int**)malloc(sizeof(int*) * 10000);
    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;
}