递归将一个字符串所有可能输出

public class datat {
    public static void permute(String str)
    {
        char[] strArray=str.toCharArray();
        permute(strArray,0,strArray.length-1);

    }
    private static void permute(char[] str,int low, int high){
        int i ;
        String cout="";
        String cout1="";
        if(low==high){
            for(i=0;i<=high;i++)
                cout+=str[i];
           System.out.println(cout);
            }
        else
        {
            for (i=low;i<=high;i++)
           {
                char temp=str[low];
                str[low]=str[i] ;
                str[i]=temp;
           permute(str,low+1,high);
           str[i]=str[low];
           str[low]=temp;

            }

        }
    }

    public static void main(String[] args) {
        String a="abcd";
        char[] strArray=a.toCharArray();
        //permute(strArray,0,strArray.length-1);
        permute(a);

    }

}