LeetCode # 690 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.

解题思路

一个很简单的BFS例子，但是需要利用空间换时间的方法来减少时间复杂度：先遍历所有的 employees 元素，并建立 (id, Employee*) 的一张映射表，这样在后面进行BFS过程时就不用每次都遍历 employees 线性表来找到当前 id 对应的Employee了。

C++代码实现

/*
// 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 totalImportance = 0;
        queue<int> Q;
        unordered_map<int, Employee*> M;

        for (int i = 0; i < employees.size(); ++i) {
            M[employees[i] -> id] = employees[i];
        }

        Q.push(id);
        while (!Q.empty()) {
            int curid = Q.front();
            Q.pop();

            totalImportance += M[curid] -> importance;
            for (int i = 0; i < M[curid] -> subordinates.size(); ++i) {
                Q.push(M[curid] -> subordinates[i]);
            }
        }

        return totalImportance;
    }
};