描述
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/
您的支持是我最大的动力