LeetCode：47. 全排列 II

/**
 * 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* nums,int numsSize,int* use){
    if(pathSize == numsSize){
        int* temp = (int*)malloc(sizeof(int) * pathSize);
        for(int i = 0;i < pathSize;i++){
            temp[i] = path[i];
        }
        ans[ansSize++] = temp;
    }
    //回溯
    for(int i = 0;i < numsSize;i++){
        //同一层每个元素使用一次，或前一位元素与当前元素值相同但并未被使用
        if(use[i] || (i != 0 && nums[i] == nums[i - 1] && use[i - 1] != 0)){
            continue;
        }
        use[i] = 1;
        path[pathSize++] = nums[i];
        //递归
        backtracking(nums,numsSize,use);
        //回溯
        pathSize--;
        use[i] = 0;
    }
}
int cmp(void* a, void* b) {
    return *((int*)a) - *((int*)b);
}
int** permuteUnique(int* nums, int numsSize, int* returnSize, int** returnColumnSizes){
    //初始化
    path = (int*)malloc(sizeof(int) * numsSize);
    ans = (int**)malloc(sizeof(int*) * 999);
    int* use = (int*)malloc(sizeof(int) * numsSize);
    //排序
    qsort(nums, numsSize, sizeof(int), cmp);
    for(int i = 0;i < numsSize;i++){
        use[i] = 0;
    }
    pathSize = ansSize = 0;
    //回溯算法
    backtracking(nums,numsSize,use);
    //返回结果
    *returnSize = ansSize;
    *returnColumnSizes = (int*)malloc(sizeof(int) * ansSize);
    for(int i = 0;i < ansSize;i++){
        (*returnColumnSizes)[i] = numsSize;
    }
    return ans;
}