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.

示例:

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.

问题分析：

雇员有上下层关系，可抽象为数结构，每个树节点的值是它的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) {
        int res = 0;
		unordered_map<int, pair<int, vector<int>>> map;
		queue<int> q;
		for (int i = 0; i < employees.size(); i++)
		{
			map[employees[i]->id] = pair<int, vector<int>>(employees[i]->importance, employees[i]->subordinates);
		}
		if (map.find(id) != map.end()) q.push(id);
		while (!q.empty())
		{
			int size = q.size();
			for (int i = 0; i < size; i++)
			{
				int index = q.front();
				res += map[index].first;
				q.pop();
				vector<int> subordinates = map[index].second;
				for (int j = 0; j < subordinates.size(); j++)
				{
					q.push(subordinates[j]);
				}
			}
		}

		return res;
    }
};