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.

Employee定义如下

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;
};

找到id所指的雇员，使用队列进行广度优先遍历，这能访问到他的所有的下属雇员，把每个雇员的重要性值累加。

#include <iostream>
#include <queue>
using namespace std;
class Solution {
public:
	int total=0;
    int getImportance(vector<Employee*> employees, int id) {
    	int index;
    	for (int i = 0; i < employees.size(); ++i) {
    		if (employees[i]->id==id) {
    			index=i;
    		}
    	}
    	queue<Employee*> q;
    	q.push(employees[index]);
    	while (!q.empty()) {
    		Employee* u=q.front();
    		q.pop();
    		total+=u->importance;
    		for (int i = 0; i < u->subordinates.size(); ++i)
    			for (int j = 0; j < employees.size(); ++j) {
    				if (u->subordinates[i] ==employees[j]->id) {
    					q.push(employees[j]);
    				}
    			}
    	}
    	return total;
    }
};