public class Test2 {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
String s = scanner.nextLine();
digui(s);
}
public static void digui(String s) {
digui(s, 1, new StringBuilder());
}
public static void digui(String s, int level, StringBuilder sb) {
if (level == s.length()+1) {
System.out.print(sb + " ");
return;
}
for (int i = 0; i < s.length(); i++) {
if (!sb.toString().contains(Character.toString(s.charAt(i))))
sb.append(s.charAt(i));
else
continue;
digui(s, level+1, sb);
sb.delete(sb.length() - 1, sb.length());
}
}
}
写一个函数实现由键盘输入任意个字母,并显示这些字母可以组成的排列情况.递归法解决.
最新推荐文章于 2021-07-10 01:09:52 发布