0031 全排列

package mooc3;
import java.util.Scanner;





public class Test01 {

	static void quanpailie(String s,String res,int n) {
		if(res.length()==n)
			System.out.println(res);
		else {
			for(int i=0;i<s.length();i++)
			{
				if(res.indexOf(s.charAt(i))<0)
					quanpailie(s,res+s.charAt(i),n);
				   
			}
		}
		
	}

	public static void main(String[] args) {
		// TODO Auto-generated method stub
      Scanner sc=new Scanner(System.in);
      String s=sc.nextLine();
      int len=s.length();
      String result="";
      Test01.quanpailie(s, result, len);
		
		
	}

}

猜你喜欢

转载自blog.csdn.net/weixin_46402983/article/details/107769468