力扣Leetcode 690. 员工的重要性 C++

最新推荐文章于 2024-07-12 07:00:17 发布

一粒大榴莲

最新推荐文章于 2024-07-12 07:00:17 发布

阅读量205

点赞数 1

分类专栏： Leetcode 文章标签： leetcode 哈希表 c++

本文链接：https://blog.csdn.net/qq_43320728/article/details/104828163

版权

Leetcode 专栏收录该内容

26 篇文章 0 订阅

订阅专栏

在这里插入图片描述
递归做法:

class Solution {
public:
    int getImportance(vector<Employee*> employees, int id) {
        for(int i=0;i<employees.size();i++){
            if(employees[i]->id == id){
                int sum = employees[i]->importance;
                if(employees[i]->subordinates.size()==0){
                    return sum;
                }
                else{
                    for(int j=0;j<employees[i]->subordinates.size();j++){
                        sum += getImportance(employees,employees[i]->subordinates[j]);
                    }
                }
                return sum; 
            }
        }
        return 0;
    }
};

加了哈希表的作法:

class Solution {
public:
    int getImportance(vector<Employee*> employees, int id) {
        map<int, Employee*> Map;
        for(Employee* e:employees){
            Map[e->id] = e;
        }
        return getImportanceHelper(Map,id);
    }
    int getImportanceHelper(map<int, Employee*> Map, int id) {
        Employee *employee = Map[id];
        for (int Id: employee->subordinates) {
            employee->importance += getImportanceHelper(Map, Id);
        }
        return employee->importance;
    }
};