题目描述
输入一个字符串,打印出该字符串中字符的所有排列。
你可以以任意顺序返回这个字符串数组,但里面不能有重复元素。
示例:
输入:s = “abc”
输出:[“abc”,“acb”,“bac”,“bca”,“cab”,“cba”]
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/zi-fu-chuan-de-pai-lie-lcof
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
代码实现
/**
* Note: The returned array must be malloced, assume caller calls free().
*/
char** ret;
int retSize;
char* path;
int pathSize;
int stringSize;
void dfs(char* s,int place);
int findChar(char* string,char c,int size);
char** permutation(char* s, int* returnSize){
if(s == NULL)
return NULL;
ret = (char**)malloc(sizeof(char*)*50000);
path = (char*)malloc(sizeof(char)*9);
retSize = 0;
pathSize = 0;
stringSize = strlen(s);
dfs(s,0);
*returnSize = retSize;
return ret;
}
void dfs(char* s,int place)
{
if(place == stringSize-1)
{
path[pathSize++] = s[place];
char* temp = (char*)malloc((pathSize+1) * sizeof(char));
memcpy(temp,path,pathSize);
temp[pathSize] = '\0';
ret[retSize++] = temp;
pathSize --;
return;
}
char* placeChar = (char*)malloc(stringSize*sizeof(char));
int index = 0;
for(int i=place;i<stringSize;i++)
{
if(findChar(placeChar,s[i],index))
continue;
placeChar[index++] = s[i];
// 交换
char temp = s[place];
s[place] = s[i];
s[i] = temp;
path[pathSize++] = s[place];
dfs(s,place+1);
// 交换回来
temp = s[place];
s[place] = s[i];
s[i] = temp;
pathSize--;
}
}
int findChar(char* string,char c,int size)
{
int flag = false;
for(int i=0;i<size;i++)
{
if(string[i] == c)
{
flag = true;
break;
}
}
return flag;
}
总结
1.全排列每个位置选取字母的选择依次为n*(n-1)*…*1
2.变量多了就乱了,归根结底是逻辑不清,没理解算法
3.回溯法,定位思想与剪枝的应用
欢迎加入群聊一起交流讨论: