分治回溯-----分治的应用之全排列问题

public class FullPermutation {
    private  static TreeSet<String> set=new TreeSet<>();
    public static void main(String[] args) {
        String s="ABC";
        char[] arr=s.toCharArray();
        permutation(arr,0,arr.length-1);
        for (String sub:set){
            System.out.println(sub);
        }
    }

    private static void permutation(char[] arr, int from, int to) {
        if (from==to) {
            set.add(String.valueOf(arr));
        }
            for (int i=from;i<=to;i++){
                swap(arr,i,from);
                permutation(arr,from+1,to);
                swap(arr,i,from);
            }

    }

    private static void swap(char[] arr, int a, int b) {
        char temp=arr[a];
        arr[a]=arr[b];
        arr[b]=temp;
    }
}

执行结果

ABC
ACB
BAC
BCA
CAB
CBA