No15. 康拓全排

import java.util.Arrays;

public class CantoPermutation {
    static final int[] X = new int[]{1,1,2,6,24,120,720,5040};

    public static void main(String[] args) {
        String[] data = new String[]{"+","-","*","/"};
        for(int i=0;i<X[data.length];i++){
            System.out.println(Arrays.toString(cantoPermutation(data,i,data.length)));
        }
    }

    private static String[] cantoPermutation(String[] data,int num,int m){
        int n = data.length;
        String[] res = new String[n];
        int[] token = new int[n];
        int group = 0;
        for(int i=0;i<m;i++){
            group = num/X[n-i-1];
            num = num%X[n-i-1];
            for(int j=0;j<n;j++){
                if(token[j]==1) continue;
                if(group==0){
                    token[j] = 1;
                    res[i] = data[j];
                    break;
                }
                group--;
            }
        }
        return res;
    }
}