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.

改题目简单理解从需要的id出发，找到下一层级id，再接着找出次下一级，构建出棵任意分支的树。每个节点有一个权重，求得是这棵树的总和。

可以理解为广度遍历，采用递归的方式来解

/*
// 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) {
        int size = employees.size();
        int score = 0;
        if(!employees.empty()){
            for(int i=0; i < size;i++){
                if(employees[i]->id == id){
                    int s = employees[i]->subordinates.size();
                    for(int j=0;j<s;j++){
                        for(int k=0;k<size;k++){
                            if(employees[k]->id==employees[i]->subordinates[j]){
                                score += getImportance(employees, employees[k]->id);
                            }
                        }
                    }
                    score += employees[i]->importance;
                    break;
                }  
            }
        }
        return score;
    }
};