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
Input: [[1, 5, [2, 3]], [2, 3, []], [3, 3, []]], 1
Output: 11

思路分析

递归的方式，根据给定的id找到employees容器中的leader，并累计leader和subordinate他们的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) {
        int importance = 0;
        vector<int> subordinates;
        for (Employee* employee : employees) {
            if (employee->id == id) {
                importance = employee->importance;
                subordinates = employee->subordinates;
                for (int i : subordinates) {
                    importance += getImportance(employees, i);
                }
                break;
            }
        }
        return importance;
    }
};