week18-leetcode #690-EmployeeImportance

week18-leetcode #690-EmployeeImportance

链接：https://leetcode.com/problems/employee-importance/description/

Related Topics：Hash Table、Depth-first Search、Breadth-first Search

Question

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
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.

Solution

/*
// 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 employees_size = employees.size();
    vector<int> importance_vec(employees_size+100, 0);
    // 好坑啊，好像这里只能用new的方法
    bool** graph = new bool*[employees_size+100];
    for (int i = 0; i < employees_size+100; i++)
      graph[i] = new bool[employees_size+100];

    for (int i = 0; i < employees_size+100; i++)
      for (int j = 0; j < employees_size+100; j++)
        graph[i][j] = false;

    bool isvisited[employees_size+100];
    for (int i = 0; i < employees_size+100; i++)
      isvisited[i] = false;

    // 构建图
    for (int i = 0; i < employees_size; i++) {
      int current_id = employees[i]->id;
      int current_importance = employees[i]->importance;
      importance_vec[current_id-1] = current_importance;
      vector<int> current_subordinates = employees[i]->subordinates;
      for (int j = 0; j < current_subordinates.size(); j++) {
        cout << "current_id" << current_id-1 << endl;
        cout << "current_subordinates[j]" << current_subordinates[j]-1 << endl;
        graph[current_id-1][current_subordinates[j]-1] = true;
      }
    }
    int cal_importance = 0;
    queue<int> my_queue;
    my_queue.push(id-1);
    isvisited[id-1] = true;
    cal_importance += importance_vec[id-1];
    cout << "cal_importance: " << cal_importance << endl;
    while (!my_queue.empty()) {
      int head = my_queue.front();
      my_queue.pop();
      for (int i = 0; i < employees_size+100; i++) {
        // 是他的后缀
        if (graph[head][i] && !isvisited[i]) {
          isvisited[i] = true;
          cal_importance += importance_vec[i];
          cout << "cal_importance: " << cal_importance << endl;
          my_queue.push(i);
        }
      }
    }
    return cal_importance;
  }

};

思路：总的来说，将输入的二维数组化为图，然后采用BFS的方式进行搜索。维护一个队列my_queue和全局的重要度cal_importance，在搜索的过程中，并不断将子节点加入到队列中，将子节点的所有重要度累加进cal_importance。