通过递归方法对一个单词所有的组合进行列举(java)

 import java.io.BufferedReader;
 import java.io.IOException;
 import java.io.InputStreamReader;

 public class Anagram{
     static int size;
     static int count;
     static String [] arr=new String[100];
     public static void main(String[] args) throws IOException {
         System.out.println("Enter a word");
         String input=getString();
         size=input.length();
         count=0;
         for(int i=0;i<size;i++)
         {
             arr[i]=input.charAt(i)+"";
         }
         doAnaram(size);
     }

     public static void rotate(int s) {
         int j;
         int position=size-s;
         String temp=arr[position];
         for(j=position+1;j<size;j++)
             arr[j-1]=arr[j];

         arr[size-1]=temp;

     }

     public static void doAnaram(int length) {
         if(length==1)
             return ;
         for(int i=0;i<length;i++)
         {
             doAnaram(length-1);
             if(length==2)
                 {
                 dispalyword();
                 }
             rotate(length);
         }

     }

     public  static void dispalyword() {
     for(int i=0;i<size;i++)
     {

         System.out.print(arr[i]+" ");
     }
         System.out.print("\t");
     }

     public static String getString() throws IOException {
         InputStreamReader isr=new InputStreamReader(System.in);
         BufferedReader br=new BufferedReader(isr);
         String s=br.readLine();
         return s;
     }
 }

效果图