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.

记录一下自己的做法,写了一个回归,感觉自己对回归的应用比以前得心应手一些了。

/*
// 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 id0,importance,result = 0,tmp = 0;
        vector<int> sub;
        for (int i = 0; i < employees.size(); i++){
            id0 = employees[i] -> id;
            if(id0 == id){
                sub = employees[i] -> subordinates;
                tmp = employees[i] -> importance;
            }
        }
        result +=tmp;
        if(sub.size()==0){
            return result;
        }
        else{
            for (int i = 0;i<sub.size();i++){
                result += getImportance(employees,sub[i]);
            }
        }
        return result;
    }
};

别人的做法用了hashmap加回归,我之前也用了hashmap,不过没有结合起来,我觉得别人做法的可取之处是在哈希表中直接用了employee这个对象指针作为value值,我觉得很有大局观,值得我学习。

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值