✌粤嵌—2024/3/25—全排列

最新推荐文章于 2024-11-15 16:27:37 发布

嵌入式小小聪

最新推荐文章于 2024-11-15 16:27:37 发布

阅读量268

点赞数 2

分类专栏：粤嵌每日一题文章标签： leetcode

本文链接：https://blog.csdn.net/qq_68915288/article/details/137793184

版权

粤嵌每日一题专栏收录该内容

52 篇文章 0 订阅

订阅专栏

文章描述了一个使用回溯法和深度优先搜索（DFS）在给定数组中生成所有可能排列的函数。函数`permute`利用递归和栈来计算并存储结果，同时处理内存分配和释放问题。

摘要由CSDN通过智能技术生成

代码实现：

回溯

/**
 * 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 **res;
int resSize;
int *path;
int pathSize;
int *vis;

void dfs(int *nums, int numsSize) {
    if (pathSize == numsSize) {
        res[resSize] = malloc(sizeof(int) * pathSize);
        memcpy(res[resSize], path, sizeof(int) * pathSize);
        resSize++;
        return;
    }
    for (int i = 0; i < numsSize; i++) {
        if (vis[i]) {
            continue;
        }
        path[pathSize] = nums[i];
        pathSize++;
        vis[i] = 1;
        dfs(nums, numsSize);
        pathSize--;
        vis[i] = 0;
    }
}

int** permute(int *nums, int numsSize, int *returnSize, int **returnColumnSizes) {
    res = malloc(sizeof(int*) * 1000);
    path = malloc(sizeof(int) * numsSize);
    vis = malloc(sizeof(int) * numsSize);
    memset(vis, 0, sizeof(int) * numsSize);
    resSize = pathSize = 0;
    dfs(nums, numsSize);
    *returnSize = resSize;
    *returnColumnSizes = malloc(sizeof(int) * resSize);
    for (int i = 0; i < resSize; i++) {
        (*returnColumnSizes)[i] = numsSize;
    }
    return res;
}