[LeetCode]690. Employee Importance员工重要信息

哈希表存id和员工数据结构

递归获取信息

public int getImportance(List<Employee> employees, int id) {
        Map<Integer,Employee> map = new HashMap<>();
        for (int i = 0; i < employees.size(); i++) {
            Employee temp = employees.get(i);
            map.put(temp.id,temp);
        }
        return helper(map,id);
    }
    public int helper(Map<Integer,Employee> map, int id)
    {
        Employee cur = map.get(id);
        List<Integer> sub = cur.subordinates;
        int res = cur.importance;
        for (int i = 0; i < sub.size(); i++) {
            res += helper(map,sub.get(i));
        }
        return res;
    }

原文地址：https://www.cnblogs.com/stAr-1/p/8343084.html