/**
* 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;
return;
}
//回溯
for(int i = 0;i < numsSize;i++){
//同一层每个元素使用一次
if(use[i]){
continue;
}
use[i] = 1;
path[pathSize++] = nums[i];
//递归
backtracking(nums,numsSize,use);
//回溯
pathSize--;
use[i] = 0;
}
}
int** permute(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);
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;
}
LeetCode:46. 全排列
最新推荐文章于 2024-09-03 18:29:17 发布
该代码段展示了一个使用回溯算法解决整数数组全排列问题的C++函数。它通过递归地尝试所有可能的路径并存储有效解决方案,同时管理内存以避免内存泄漏。
摘要由CSDN通过智能技术生成