python--leetcode690. 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.

Note:

1. One employee has at most one direct leader and may have several subordinates.
2. The maximum number of employees won't exceed 2000.

题目意思就是题目自定了一个数据结构，第一个值为id，第二个值为权重，第三个值为下属。一个公司每个人对应一个数据结构，给你一个人的id，让你返回他以及他的所有下属的权重和。

先上代码，一会说思路：

# 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, id):
        """
        :type employees: Employee
        :type id: int
        :rtype: int
        """
        a=[]
        sum=0
        a.append(id)
        while a:
            id=a[0]

            sum=employees[id-1][1]+sum
            if employees[id-1][2] :
                for i in range(len(employees[id-1][2])):

                    a.append(employees[id-1][2][i])
            a.remove(id)
        return sum

# class Solution(object):
#     def getImportance(self, employees, id):
#         """
#         :type employees: Employee
#         :type id: int
#         :rtype: int
#         """
#         a=[]
#         sum=0
#         a.append(id)
#         while a:
#             id=a[0]
#
#             sum=employees[id-1].importance+sum
#             if employees[id-1].subordinates :
#                 for i in range(len(employees[id-1].subordinates)):
#
#                     a.append(employees[id-1].subordinates[i])
#             a.remove(id)
#         return sum

s=Solution()
print(s.getImportance([[1, 5, [2, 3]], [2, 3, []], [3, 3, []]], 1))

注释部分是提交可以通过的部分，直接运行以上代码是可以运行的。

这一题的思路就是开一个list  a作为辅助，把应该要统计的人的id加进去，统计完成后删除，直到a为空。

更简单的写法，通过递归：

class Solution(object):
    def getImportance(self, employees, id):
        """
        :type employees: Employee
        :type id: int
        :rtype: int
        """
        # Time: O(n)
        # Space: O(n)
        emps = {employee.id: employee for employee in employees}
        def dfs(id):
            subordinates_importance = sum([dfs(sub_id) for sub_id in emps[id].subordinates])
            return subordinates_importance + emps[id].importance
        return dfs(id)