[LeetCode] 690. Employee Importance

Problem :

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.

题目要求根据给定的所有员工信息（员工id，importance值，所有直属下属的id）和某个员工的id，求得这个员工及其下属的

总的importance值，很显然这是一个深度优先搜索问题( 关于深度优先算法的详细可以参考这个博客：深度优先搜索 )

回到这个问题，其实解决思路十分清晰，根据给定的id我们可以求得这个id对应的员工的importance值，并且可以获得该员工

的直属下属的id，通过遍历可求得该员工及其直属下属的总的importance值，而其下属的下属（即该员工的非直属下属）的

importance值可以通过递归过程求得，具体实现（递归求解）如下：

/*
// Employee info
class Employee {
public:
    // It's the unique ID of each node.
    // unique id of this employee
    int id;
    // the importance value of this employee
    int importance;
    // the id of direct subordinates
    vector<int> subordinates;
};
*/
class Solution {
public:
    int getImportance(vector<Employee*> employees, int id) {
        unordered_map<int, Employee*> mapping;
        for (auto e : employees) {
            mapping[e->id] = e;
        }
        return calculateImportance(mapping, id);
    }
    
    int calculateImportance(unordered_map<int, Employee*> & mapping, int id) {
        int totalImportance = mapping[id]->importance;
        for (auto sub : mapping[id]->subordinates) {
            totalImportance += calculateImportance(mapping, sub);
        }
        return totalImportance;
    }
};

可能用到的链接： 关于unordered_map容器