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.

题意：雇员的信息包括唯一id，重要程度value，以及其直接下属的id。现在给出公司雇员信息与某一雇员的id，要求求出该雇员及其下属(这里包括下属的下属)的重要程度value之和。

思路：由题意我们可以将公司内雇员信息抽象称为一有向图，由某雇员到其直接下属之间有一条有向边，每个节点处有一权值为该雇员的value。则问题就可以转化为求以给定雇员为根的子树上所有节点的权值之和。

class Solution {
public:
    //这里的id并不是按顺序的!!!!! 要先建立起雇员下标与其id的映射 
    //雇员最多2000个，可以直接使用hash数组
    Employee* hash[2000];
    int solve(vector<Employee*> &em, int id) {
        int sum=hash[id]->importance;
        for(int i=0;i<hash[id]->subordinates.size();i++){
            sum+=solve(em,hash[id]->subordinates[i]);
        }
        return sum;
    }
    int getImportance(vector<Employee*> em, int id) {
        for(int i=0;i<em.size();i++)
            hash[em[i]->id]=em[i];
            //mp[em[i]->id]=em[i];
        return solve(em,id);
    }
};