互异元素全排列–递归实现

代码实现

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
import java.util.*;
public class Solution {
public void permutation1(String str, String result, int len){
if(result.length() == len){
System.out.println(result);
}
else {
for(int i = 0; i < str.length(); i++){
if(result.indexOf(str.charAt(i)) < 0){
permutation1(str, result + str.charAt(i), len);
}
}
}
}
public static void main(String[] args){
String s = "123";
resutl = "";
(new Solution()).permutation1(s, result, s.length());
}
}

思路

暂无