[数据结构与算法]690. 员工的重要性

>690. 员工的重要性<

>getImportance<

一、解题思路

1、解法一( Java )

解法思路：哈希表 + DFS

/**
 * @author listen1024
 * @date 2022-2-15
 * 690. 员工的重要性
 */
 
/*
// Definition for Employee.
class Employee {
    public int id;
    public int importance;
    public List<Integer> subordinates;
};
*/

class Solution {
    private int res = 0;
    public int getImportance(List<Employee> employees, int id) {
        Map<Integer, Employee> map = new HashMap<>();
        for (Employee e : employees) {
            map.put(e.id, e);
        }
        dfs(map, id);
        return res;
    }
    
    public void dfs(Map<Integer, Employee> map, int id) {
        Employee e = map.get(id);
        if (e == null) return;
        
        res += e.importance;
        for (Integer subId : e.subordinates) {
            dfs(map, subId);
        }
    }
}

运行结果截图如下：