1、回溯法,利用辅助数组。
/**
* 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().
*/
void dfs(int *nums, int numsSize, int *mask, int index, int *path, int **ret, int *ret_index){
for(int i = 0; i<numsSize; i++){
if(mask[i]==1)
continue;
mask[i]=1;
path[index] = nums[i];
if(index == numsSize-1){
ret[*ret_index] = (int *)malloc(sizeof(int) * numsSize);
memcpy(ret[*ret_index], path, numsSize*sizeof(int));
(*ret_index)++;
}
dfs(nums,numsSize,mask,index+1,path,ret,ret_index);
mask[i]=0;
}
}
int** permute(int* nums, int numsSize, int* returnSize, int** returnColumnSizes){
int i;
*returnSize = 1;
for(i = 1; i<=numsSize; i++)
*returnSize = (*returnSize)*i;
int **ret = (int **)malloc(sizeof(int *) * (*returnSize));
int *ret_size = (int *)malloc(sizeof(int) * (*returnSize));
int index = 0;
int ret_index = 0;
int path[numsSize],mask[numsSize];
memset(mask,0,sizeof(mask));
dfs(nums,numsSize,mask,index,path,ret,&ret_index);
*returnColumnSizes = ret_size;
for(i=0; i<ret_index; i++)
ret_size[i] = numsSize;
return ret;
}
2、回溯法、交换数组元素
转载至:
https://blog.csdn.net/weixin_36094222/article/details/90143695
/*
* 算法思想:
* 经典回溯算法框架能解决的问题,其中回溯返回的条件为index到头了
*
*/
void swap(int *a, int *b){
int tmp = *a;
*a = *b;
*b = tmp;
}
void rec(int *arr, int len, int index, int **ret, int *ret_index){
int i;
//printf("index=%d\n", index);
if(index == len-1){
ret[*ret_index] = (int *)malloc(sizeof(int) * len);
memcpy(ret[*ret_index], arr, len*sizeof(int));
(*ret_index)++;
return;
}
/* 将index位置的元素,分别和其后面的元素交换位置,交换后再考虑index+1位置及以后的全排列 */
/* 假设元素为1 2 3 4 5,则全排列个数为5*四个元素全排列,即在位置1处有5种可能,1 2 3 4 5 都在位置1的话
* 假设1的位置固定为1,则还有2 3 4 5四个元素的全排列,如此递归下去到index到最后一个元素即可结束回溯。
*/
for(i=index; i<len; i++){
swap(&arr[i], &arr[index]);
rec(arr, len, index+1, ret, ret_index);
swap(&arr[i], &arr[index]);
}
}
#define LEN 0xffff
int** permute(int* arr, int len, int* returnSize, int** returnColumnSizes){
int **ret = (int **)malloc(sizeof(int *) * LEN);
int *ret_size = (int *)malloc(sizeof(int) * LEN);
int ret_index = 0;
int i;
rec(arr, len, 0, ret, &ret_index);
*returnColumnSizes = ret_size;
for(i=0; i<ret_index; i++){
//printf();
ret_size[i] = len;
}
// printf("ret_index:%d\n", ret_index);
*returnSize = ret_index;
return ret;
}
我觉得第二种方法很巧妙,很难想到,佩服。