690. Employee Importance

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:

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

分析题意，本质上是搜索一棵树

     【1】
      /      \
 【2】 【3】

首先创建一个待遍历队列，队列存储即将等待遍历的元素，然后将【1】加入队列中。遍历【1】的孩子节点【2】【3】，由于【1】是【2】【3】的父节点，所以1的importance 等于【1】的importance 加上【2】、【3】的importance，即 5 + 3 + 3 = 11
如果【2】【3】下面也有孩子，则将它们孩子节点加入到待遍历的队列中。

个人觉得，上述过程是一个广搜，代码如下：

/*
// 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) {    
        Map<Integer, Employee> map = new HashMap<>();
        for(Employee e: employees) {
            map.put(e.id, e);
        }
        List<Integer> list = new LinkedList<>();
        list.add(id);
        int importance = 0;
        while(list.size() > 0) {
            Employee e = map.get(list.get(0));        
            importance += e.importance;
            if(e.subordinates != null) {
                for(int eid: e.subordinates) {
                    list.add(eid);
                }
            }        
            list.remove(0);            
        }
        return importance;        
    }
}