690. Employee Importance

题目：

You are given a data structure of employee information, which includes the employee's unique id, their importance value and their 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 their 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.

 

 

 

 

思路：

基本功题目。给定一个数据结构，里面有三样东西：自身id，自身重要度(一个int的值来衡量)，以及自己直系下属(们)的id。每个人的直系领导只有一个，而直系下属可能有几个。题目给出整个公司的关系，和一个员工id，求该员工自身与所有下属的重要度之和。首先为了快速查找，肯定需要把员工信息用哈希表存下来，key为id，value为信息。之后查找用BFS或者DFS都可以，这里采用的BFS，用queue模拟，一直查找到队列中没有下一个下属的id即可。

 

 

 

代码：

/*

// Definition for Employee.

class Employee {

public:

    int id;

    int importance;

    vector<int> subordinates;

};

*/

 

class Solution {

public:

    int getImportance(vector<Employee*> employees, int id) {

        unordered_map<int, Employee*> record;

        for(auto &e:employees)

            record[e->id]=e;

        queue<int> q;

        q.push(id);

        int sum=0;

        while(q.size())

        {

            int len=q.size();

            for(int i=0;i<len;i++)

            {

                auto t=q.front();

                q.pop();

                sum+=record[t]->importance;

                if(!record[t]->subordinates.empty())

                {

                    for(auto s:record[t]->subordinates)

                        q.push(s);

                }

            }

        }

        return sum;

    }

};