LeetCode-Employee Importance

Description：
You are given a data structure of employee information, which includes the employee’s unique id, his importance value and his direct subordinates’ 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:

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

题意：给定一个员工的序列，其中每个元素描述了员工的id，importance value 及其直接领导的子员工；现在要求计算给定的员工id其importance value及其所有子员工（包括直接和间接的）的importance value的和；

解法：这道题目需要利用到广度优先遍历和深度优先遍历，因为给定id的员工有很多的直接子员工，这些子员工又会有自已的直接子员工，因此涉及到广度和深度两个方向；又因为每个员工的id是唯一的，我们可以根据这个id构建一个哈希表，来快速的定位这个员工；
综上，我们根据给定的一个员工id，遍历这个员工的所有子员工，对所有子员工，再递归调用，每次都将其importance value累加；最后，返回总的importance value；

Java

/*
// 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 {
    Map<Integer, Integer> table = new HashMap<>();
    public int getImportance(List<Employee> employees, int id) {
        int result = 0;
        for (int i = 0; i < employees.size(); i++) {
            table.put(employees.get(i).id, i);
        }
        return getAllImportance(employees, id);
    }
    private int getAllImportance(List<Employee> employees, int id) {
        int result = 0;
        for (int i = 0; i < employees.get(table.get(id)).subordinates.size(); i++) {
            result += getAllImportance(employees, employees.get(table.get(id)).subordinates.get(i));
        }
        return result + employees.get(table.get(id)).importance;
    }
}