自己搞清楚的第一个树结构，用树生成全排列

Posted 2020-11-29 小城熊儿

import java.util.Arrays;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.Scanner;
import java.util.Stack;

public class Main07 {
    public static void main(String[] args) {
        
        Scanner sc = new Scanner(System.in);
        while(sc.hasNext()) {
            String str = sc.nextLine();
            str = str.trim();
            String[] strs = str.split("\\s");
            
            //划分
            int count = Integer.parseInt(strs[0]);
            String[] dict = Arrays.copyOfRange(strs, 1, count+1);
            //System.out.println(Arrays.asList(dict).toString());
            
            //看兄弟单词，组合所有兄弟单词；
            String bro = strs[count + 1];
            char[] charArray = bro.toCharArray();
            LinkedList<String> linkedList = new LinkedList<String>();
            perm(charArray,new Stack<>(),linkedList);
            linkedList = new LinkedList<String>(new HashSet<>(linkedList));
            linkedList.remove(bro);
            
            //查找
            int co = 0;
            for (int i = 0; i < linkedList.size(); i++) {
                for (int j = 0; j < dict.length; j++) {
                    if(linkedList.get(i).equals(dict[j])) {
                        co++;
                    }
                }
            }
            System.out.println(co);
            
            
            //输出指定目录
            String orderstr = strs[count + 2];
            System.out.println(dict[Integer.parseInt(orderstr)]);
            
            dict = null;
            
        }
        
    }

    private static void perm(char[] charArray, Stack stack, LinkedList<String> linkedList) {
        // TODO Auto-generated method stub
        if(charArray.length==0) {
            String a = "";
            for (int i = 0; i < stack.size(); i++) {
                a=a+stack.get(i);
            }
            linkedList.add(a);
        }
        
        for (int i = 0; i < charArray.length; i++) {
            char[] Array = new char[charArray.length-1];
            System.arraycopy(charArray, 0, Array, 0, i);
            System.arraycopy(charArray, i+1, Array, i, charArray.length-i-1);
            stack.push(charArray[i]);
            perm(Array,stack,linkedList);
            stack.pop();
        }
    }
}