奇安信笔试编程题

「爱情、让人受尽委屈。」 2024-04-18 17:02 74阅读 0赞

![watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L1JleF9XVVNU_size_16_color_FFFFFF_t_70][]

package one;
    
    import java.util.*;
    
    /**
     * 3 1 5 21 10 7
     * 0 3 3 1 5 3
     * 3
     * 3 1 5 21 10
     * 0 3 3 1 5
     * 5
     */
    public class Main {
    
        public static int result;
    
        public static void main(String[] args) {
            Scanner sc = new Scanner(System.in);
            while (sc.hasNextLine()) {
    
                String[] str1 = sc.nextLine().trim().split(" ");
                String[] str2 = sc.nextLine().trim().split(" ");
                String target = sc.nextLine();
                result = 0; //每轮循环都重置一下result。至少有一个进程被杀死
                List<String> nodeList = new ArrayList<>();
                for (int i = 0; i < str1.length; i++) {
                    nodeList.add(str1[i]);
                }
    
                //构建关系
                HashMap<String, List<String>> map = new HashMap<>();
                for (int i = 0; i < str2.length; i++) {
                    String key = str2[i];
                    if (map.containsKey(key)) {
                        map.get(key).add(str1[i]);
                    } else if (key.equals("0")) {
                        //什么也不做。不保存没有父进程的进程
                    } else {
                        List<String> list = new ArrayList<String>();
                        list.add(str1[i]);//注意要将这个元素塞到链表里面
                        map.put(key, list);
                    }
                }
    
    
                //统计
                if (nodeList.contains(target)) {
                    result = 1;
                    if (map.containsKey(target)) { //如果map里面有 target，说明target有子进程
                        count(map, map.get(target));
                    }
                    System.out.println(result);
                } else { //如果target不是树中的结点
                    System.out.println("0");
                }
    
            }
        }
    
        /**
         * 查看list中的结点有不有子节点
         *
         * @param map
         * @param list
         */
        public static void count(HashMap<String, List<String>> map, List<String> list) {
            if (list == null || list.size() == 0) {
                return;
            }
    
            result = result + list.size(); //先先把当前进程都所有子进程都计数到 “被删除进程”
    
            for (String str : list) {
                if (map.containsKey(str)) { //如果子进程还有子进程，接着统计
                    count(map, map.get(str));
                }
            }
    
        }
    }

[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L1JleF9XVVNU_size_16_color_FFFFFF_t_70]: https://image.dandelioncloud.cn/pgy_files/images/2024/04/18/1462134fa7fe4284861d0fbc4c05e59f.png