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:
One employee has at most one direct leader and may have several subordinates.
The maximum number of employees won’t exceed 2000.

/*
// 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) {
        //这道题要采用广度优先搜索的方法来实现
        if (employees.size() == 0)
            return 0;
        int num = 0;
        int index = 0;
        int size1 = 0;
        int size2 = 0;
        int temp = 0;
        int id1 = id;
        int flag = false;
        queue<int> que;
        size1 = employees.size();
        for (int i = 0; i < size1; i++) {
            if (employees[i] -> id == id1) {
                flag = true;
                index = i;
                size2 = (employees[i] ->
                 subordinates).size();
                num += employees[i] -> importance;
                for (int j = 0; j < size2; j++)
                  que.push(employees[i] ->
                   subordinates[j]);
                break;
            }
        }
        if (flag == true) {
            while (!que.empty()) {
              temp = que.front();
              for (int i = 0; i < size1; i++) {
                  if (employees[i] -> id == temp) {
                      num += employees[i] ->
                       importance;
                      size2 = (employees[i] ->
                       subordinates).size();
                      for (int j = 0; j < size2; j++)
                        que.push(employees[i] -> 
                        subordinates[j]);
                      break;
                  }
              }
              que.pop();
            }    
        }
        return num;
    }
};

这道题目没有什么特别的技巧，就直接使用图的层序遍历，也即广度优先搜索就可以做出来了，总体来看还是比较简单的。时间复杂度的话，假设有N个顶点的话就是：O(N)