阿里云高校计划Day6

import java.util.ArrayList;
import java.util.LinkedList;
import java.util.List;

class Solution {

     public static int[] getCha(int[] arr2,int n){
        int[] arr1 = new int[2*n];
        
        for(int a = 0;a<2*n;a++){
            arr1[a] = a;
        }

        int[] arr3 = extracted(n);
        int k = 0;
        boolean flag = false;
        for(int i= 0;i<arr1.length;i++){
            for(int j = 0;j<arr2.length;j++){
                if(arr1[i] == arr2[j]){
                    flag = true;
                    break;
                }
            }
            if(!flag){
                arr3[k] = arr1[i];
                k++;
            }
            flag = false;
        }
        return arr3;
    }

	private static int[] extracted(int n) {
		int[] arr3 = new int[n];
		return arr3;
	}
    //从a乘到b
    public static int getSameCount(int a, int b) {
        if(a==1){
            return 1;
        }else{
            if(a > b) {
                return a * getSameCount(a - 1, b);
            }else{
                return a;
            }
        }
    }

    	//字符串反转
    public static String reverse(String str){
        String new_s1 = "";
        for (int i = str.length() - 1; i >= 0; i--) {
            new_s1 += str.charAt(i);
        }
        return new_s1;
    }
	
	//深度优先算法
    public static List<List<Integer>> combine(int n, int k) {
        List<List<Integer>> res = new LinkedList<>();
        boolean[] f = new boolean[n];
        List<Integer> tmp = new ArrayList<>(k);

        dfs(k, 0, n, f, tmp, res);

        return res;
    }
    private static void dfs(int left, int s, int n, boolean[] f, List<Integer> tmp, List<List<Integer>> res) {
        if(0 == left) {
            res.add(tmp);
            return;
        }

        for(int i = s; i < n; i++) {
            if(f[i])
                continue;

            f[i] = true;
            List<Integer> t = new ArrayList<>(tmp);
            t.add(i+1);
            dfs(left-1, i+1, n, f, t, res);

            f[i] = false;
        }
    }
    
    public long solution(int n, String s) {
      
        int count = 0;
        if(s.length() == 2 && s.substring(0,n).equals(s.substring(n,2*n)))
            count = 2;
        }else if(s.substring(0,n).equals(s.substring(n,2*n))){
        
            count = getSameCount(2*n,n+1)/2;
        }else {
        	List result = combine(2*n,n);

        	char[] array = s.toCharArray();

        	String a = "";
        	String b = "";

            for (int i = 0; i < result.size(); i++) {

                List temp = (List) result.get(i);
                int[] arr2 = new int[n];

                for (int j = 0; j < n; j++) {
                    a = a + array[(int) temp.get(j) - 1];
                    arr2[j] = (int) temp.get(j) - 1;
                }
				
                int[] arr3 = getCha(arr2, n);
                for (int k = 0; k < n; k++) {
                    b = b + array[arr3[k]];
                }
				
                if (a.equals(reverse(b))) {
                    count++;
                }
                a = "";
                b = "";
            }
        }
        return count;
    }
}

阿里云高校计划.