LeetCode：491. 递增子序列

/**
 * 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;
//查找相同元素
int search(int* use,int useSize,int key){
    for(int i = 0;i < useSize;i++){
        if(use[i] == key) return 1;
    }
    return 0;
}
//回溯算法
void backtracking(int* nums,int numsSize,int start){
    if(pathSize > 1){
        int* temp = (int*)malloc(sizeof(int) * pathSize);
        for(int i = 0;i < pathSize;i++){
            temp[i] = path[i];
        }
        length[ansSize] = pathSize;
        ans[ansSize++] = temp;
    }

    int* use = (int*)malloc(sizeof(int) * numsSize);
    int useSize = 0;
    //回溯
    for(int i = start;i < numsSize;i++){
        //保证为递增子序列，和去重
        if(pathSize > 0 && nums[i] < path[pathSize - 1] || search(use,useSize,nums[i])){
            continue;
        }
        use[useSize++] = nums[i];
        path[pathSize++] = nums[i];
        //递归
        backtracking(nums,numsSize,i + 1);
        //回溯
        pathSize--;
    }
}
int** findSubsequences(int* nums, int numsSize, int* returnSize, int** returnColumnSizes){
    //初始化
    path = (int*)malloc(sizeof(int) * numsSize);
    ans = (int**)malloc(sizeof(int*) * 33000);
    length = (int*)malloc(sizeof(int*) * 33000);
    pathSize = ansSize = 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;
}