LeetCode.690 Employee Importance

题目：

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 importance value of employee 1 is 5 + 3 + 3 = 11.

Note:

1. One employee has at most one direct leader and may have several subordinates.
2. The maximum number of employees won't exceed 2000.

分析：

/*
// 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 static int getImportance(List<Employee> employees, int id) {
        //给定上下级关系和价值，返回编号id员工的总的价值
        //注意：每个员工只有一个上级，可以有多个下属。员工的最大数量不超过2000
        //思路：使用数组存储各个员工的价值，再建立一个HashMap存储id对应的下属关系List集合
        //ps：需要考虑所有的子下属的价值，类似DFS

        int [] idArray=new int[2001];
        HashMap<Integer,List<Integer>> hm=new HashMap<Integer,List<Integer>>();

        for(Employee employee:employees){
            idArray[employee.id]=employee.importance;

            //将id和下属集合放入map
            hm.put(employee.id,employee.subordinates);
        }

        //取出对应id员工的价值，需要递归求出
        int value=0;
        //递归调用查询id的价值
        value+=DFS(id,idArray,hm);
        return value;
    }
    public static int DFS(int id,int [] idArray,HashMap<Integer,List<Integer>> hm){
        int subValue=0;
        subValue+=idArray[id];
        //如果当前子下属为空，则直接返回其的价值
        if(hm.get(id).size()==0)return subValue;
        //若子下属不为空，则递归叠加
        for(Integer i:hm.get(id)){
            subValue+=DFS(i,idArray,hm);
        }
        return subValue;
    }
}