这是一个不错的利用递归的例子,转载一下
public static void main(String[] args) {
System.out.println(Arrays.toString(permutation("1234")));
}

private static String[] permutation(String orginal){
ArrayList<String> list = new ArrayList<String>();
if(orginal.length() == 1){
return new String[];
} else{
for (int i = 0; i < orginal.length(); i++) {
String s = orginal.charAt(i) + "";
String result = "";
String resultA = result + s;
String leftS = orginal.substring(0, i) + orginal.substring(i + 1, orginal.length());
for (String element : permutation(leftS)) {
result = resultA + element;
list.add(result);
}
}
return (String[]) list.toArray(new String[list.size()]);
}
}
System.out.println(Arrays.toString(permutation("1234")));
}

private static String[] permutation(String orginal){
ArrayList<String> list = new ArrayList<String>();
if(orginal.length() == 1){
return new String[];
} else{
for (int i = 0; i < orginal.length(); i++) {
String s = orginal.charAt(i) + "";
String result = "";
String resultA = result + s;
String leftS = orginal.substring(0, i) + orginal.substring(i + 1, orginal.length());
for (String element : permutation(leftS)) {
result = resultA + element;
list.add(result);
}
}
return (String[]) list.toArray(new String[list.size()]);
}
}
本文介绍了一个使用递归算法实现字符串全排列的例子。通过Java代码展示了如何对一个字符串进行全排列操作,适用于理解递归原理及其实现方式。

2041

被折叠的 条评论
为什么被折叠?



