给定一个保存员工信息的数据结构,它包含了员工唯一的id,重要度 和 直系下属的id。
比如,员工1是员工2的领导,员工2是员工3的领导。他们相应的重要度为15, 10, 5。那么员工1的数据结构是[1, 15, [2]],员工2的数据结构是[2, 10, [3]],员工3的数据结构是[3, 5, []]。注意虽然员工3也是员工1的一个下属,但是由于并不是直系下属,因此没有体现在员工1的数据结构中。
现在输入一个公司的所有员工信息,以及单个员工id,返回这个员工和他所有下属的重要度之和。
示例 1:
输入: [[1, 5, [2, 3]], [2, 3, []], [3, 3, []]], 1
输出: 11
解释:
员工1自身的重要度是5,他有两个直系下属2和3,而且2和3的重要度均为3。因此员工1的总重要度是 5 + 3 + 3 = 11。
注意:
- 一个员工最多有一个直系领导,但是可以有多个直系下属
- 员工数量不超过2000。
第一种思路:
DFS,res每次先加自己的importance,再去找下属。
"""
# Employee info
class Employee(object):
def __init__(self, id, importance, subordinates):
# It's the unique id of each node.
# unique id of this employee
self.id = id
# the importance value of this employee
self.importance = importance
# the id of direct subordinates
self.subordinates = subordinates
"""
class Solution(object):
def getImportance(self, employees, i):
"""
:type employees: Employee
:type id: int
:rtype: int
"""
self.res = 0
def dfs(subs):
for sub in subs:
for employee in employees:
if employee.id == sub:#就是这个要找的员工
self.res += employee.importance
dfs(employee.subordinates)#找他的下属员工
dfs([i])
return self.res
第二种思路:
在第一种思路的基础上优化,不需要每次都从employees里遍历查找importance和subordinates,
而是用一个hashmap先记录好所有需要的结果,这样可以极大地提高查找速度。
class Solution(object):
def getImportance(self, employees, i):
"""
:type employees: Employee
:type id: int
:rtype: int
"""
self.res = 0
hashmap = dict()
for employee in employees:
hashmap[employee.id] = [employee.importance, employee.subordinates]
def dfs(subs):
for sub in subs:
self.res += hashmap[sub][0]
dfs(hashmap[sub][1])#找他的下属员工
dfs([i])
return self.res
class Solution:
def getImportance(self, employees: List['Employee'], id: int) -> int:
id2imp = dict()
sup2sub = dict()
for i, ee in enumerate(employees):
idd, imp, subs = ee.id, ee.importance, ee.subordinates
id2imp[idd] = imp
sup2sub[idd] = subs
def dfs(node):
if not node:
return 0
res = id2imp[node]
for sub in sup2sub[node]:
res += dfs(sub)
return res
return dfs(id)
第三种思路:
BFS实现。
class Solution(object):
def getImportance(self, employees, i):
"""
:type employees: Employee
:type id: int
:rtype: int
"""
res = 0
hashmap = dict()
for employee in employees:
hashmap[employee.id] = [employee.importance, employee.subordinates]
queue = [i]
while(queue):
next_queue = []
for item in queue:
res += hashmap[item][0]
next_queue += hashmap[item][1] #把下属列表加入下一次的queue
queue = next_queue[:]
return res