leetcode 690. Employee Importance(python)

本文介绍如何利用递归方法解决员工信息问题,给定员工ID,快速计算其及下属总价值。通过实例解析了数据结构和解决方案,适用于公司员工等级查询。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

描述

You are given a data structure of employee information, which includes the employee’s unique id, their importance value and their 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 their 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.

解析

根据题意,就是有员工类,记录了员工的 id ,value 和下属的 id ,计算某个员工及其下属的所有 value 之和。使用递归最简单,这里使用了技巧,用字典 d 记录了 id 和对象的映射关系,这样在查找的时候很方便地就可以求和。

解答

 class Solution(object):
    def getImportance(self, employees, id):
        """
        :type employees: List[Employee]
        :type id: int
        :rtype: int
        """
        d = {employee.id:employee for employee in employees}
        def dfs(id):
            r = 0
            r += d[id].importance
            for employee in d[id].subordinates:
                r += dfs(employee)
            return r
        return dfs(id)           	      

运行结果

Runtime: 152 ms, faster than 81.52% of Python online submissions for Employee Importance.
Memory Usage: 14.9 MB, less than 52.68% of Python online submissions for Employee Importance.

原题链接:https://leetcode.com/problems/employee-importance/

您的支持是我最大的动力

评论 3
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

王大丫丫

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

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

余额充值