[Leetcode从零开刷]690. Employee Importance

题目来源：
leetcode:
You are given a data structure of employee information, which includes the employee’s unique id, his importance value and his directsubordinates’ id.
For example, employee 1 is the leader of employee 2, and employee 2 is the leader of employee 3. They have importance value 15, 10 and 5, respectively. Then employee 1 has a data structure like [1, 15, [2]], and employee 2 has [2, 10, [3]], and employee 3 has [3, 5, []]. Note that although employee 3 is also a subordinate of employee 1, the relationship is not direct.
Now given the employee information of a company, and an employee id, you need to return the total importance value of this employee and all his subordinates.

Example 1:
Input: [[1, 5, [2, 3]], [2, 3, []], [3, 3, []]], 1
Output: 11
Explanation:
Employee 1 has importance value 5, and he has two direct subordinates: employee 2 and employee 3. They both have importance value 3. So the total

这个题非常经典，需要对数据结构非常熟悉才行。

肯定要用Hash列表
一种解法需要用到全局变量。

/*
// Employee info
class Employee {
    // It's the unique id of each node;
    // unique id of this employee
    public int id;
    // the importance value of this employee
    public int importance;
    // the id of direct subordinates
    public List<Integer> subordinates;
};
*/
class Solution {
    HashMap<Integer,Employee> map;  //申明全局
    public int getImportance(List<Employee> employees, int id) {
        map = new HashMap<>();
        for(Employee e : employees){
            map.put(e.id,e);   //对于输入的数组，保存id和相对应的小数组
        } 
        return dfs(id);    
    }

    public int dfs(int m){
        Employee temp = map.get(m);  //找到小数组
        int res = temp.importance;   //加上重要性
        for(int e: temp.subordinates){  //对于小数组中的小数组，深度搜索一下ID值
            res +=dfs(e);
        }
        return res;

    } 
}

/*
// Employee info
class Employee {
    // It's the unique id of each node;
    // unique id of this employee
    public int id;
    // the importance value of this employee
    public int importance;
    // the id of direct subordinates
    public List<Integer> subordinates;
};
*/
class Solution {

    public int getImportance(List<Employee> employees, int id){
        HashMap<Integer,Employee> map = new HashMap<>();
        Queue<Employee> queue = new LinkedList<>();
        int res = 0;
        for(Employee e : employees){
            map.put(e.id,e);
        }

        queue.offer(map.get(id));

        while(!queue.isEmpty()){
            Employee temp = queue.poll();
            res += temp.importance;
            for(int e:temp.subordinates){
                queue.offer(map.get(e));
            }     
        }
        return res;
    }
}