花了一中午终于理解了!
第一种情况: 1 2 3 4 无重复字符
每次固定第一个 然后剩余的在进行全排
1-234
2-134
3-214
4-231
接下来:
234重排
2-34
3-24
4-32
其他都一样了
直接上代码
public class Main {
static void P(char[] s , int start,int length){
if(start==length-1){
System.out.println(s);
}else{
for (int i = start; i < length; i++) {
s = swap(s,start,i);
P(s,start+1,length);
s = swap(s,start,i);
}
}
}
private static char[] swap(char[] s, int start, int i) {
char c = s[start];
s[start] = s[i];
s[i] = c;
return s;
}
public static void main(String[] args) {
//无重复
char[] s = {'1','2','3','4'};
P(s,0,4);
}
}
public class Main {
static void P(char[] s , int start,int length){
if(start==length-1){
System.out.println(s);
}else{
for (int i = start; i < length; i++) {
if(!isSwap(s,start,i)) continue;
s = swap(s,start,i);
P(s,start+1,length);
s = swap(s,start,i);
}
}
}
/**
* 嘉策是否已经被交换过 即是否为重复字符
* @param s 字符数组
* @param start 开始
* @param i 结束
* @return true 没有交换过 false 交换过
*/
private static boolean isSwap(char[] s, int start, int i) {
for (int j = start; j < i; j++) {
if(s[j]==s[i]){
return false;
}
}
return true;
}
private static char[] swap(char[] s, int start, int i) {
char c = s[start];
s[start] = s[i];
s[i] = c;
return s;
}
public static void main(String[] args) {
//有重复
char[] c = {'1','2','2','4'};
P(c,0,4);
}
}
我们进行如下优化:
public class Main {
static void P(char[] s , int start,int length){
if(start==length-1){
System.out.println(s);
}else{
//标记
int mark[] = new int[256];
for (int i = start; i < length; i++) {
if(mark[s[i]]==1) continue;
mark[s[i]]=1;
s = swap(s,start,i);
P(s,start+1,length);
s = swap(s,start,i);
}
}
}
private static char[] swap(char[] s, int start, int i) {
char c = s[start];
s[start] = s[i];
s[i] = c;
return s;
}
public static void main(String[] args) {
//无重复
char[] s = {'1','2','3','4'};
P(s,0,4);
System.out.println("****************************************");
//有重复
char[] c = {'1','2','2','4'};
P(c,0,4);
}
}
希望对你们理解有帮助!!