leetcode690

最新推荐文章于 2021-05-01 15:08:50 发布

微躺青年

最新推荐文章于 2021-05-01 15:08:50 发布

阅读量128

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/qq_43768560/article/details/102297623

版权

LeetCode 专栏收录该内容

20 篇文章 0 订阅

订阅专栏

分析：bfs

/*
// 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 sum = 0;
    int getImportance(vector<Employee*> employees, int id) {
        int index;
        for(int i = 0; i < employees.size(); i ++){
            if(employees[i] == nullptr){
                return sum;
            }
            if(employees[i]->id == id){
                sum += employees[i]->importance;
                index = i;
            }
        }
        for(int i = 0; i < employees[index]->subordinates.size(); i ++){
            getImportance(employees, employees[index]->subordinates[i]);
        }
        return sum;
    }
};