** 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.**
个人解题思路:通过遍历,寻找id对应的employees,记录其重要值importance,接着通过读取subordinates的值,进行迭代叠加。
/*
// Employee info
class Employee {
// It's the unique id of each node;
// unique id of this employee
public int id;
// the importance value of this employee
public int importance;
// the id of direct subordinates
public List<Integer> subordinates;
};
*/
class Solution {
public int getImportance(List<Employee> employees, int id) {
int sum = 0;
int result = getImportance(employees,id,sum);
return result;
}
public int getImportance(List<Employee> employees, int id,int sum){
for(Employee e:employees){
if(e.id == id){
sum = sum + e.importance;
if(e.subordinates!=null)
for(Integer i:e.subordinates) sum = getImportance(employees,i,sum);
break;
}
}
return sum;
}
}
运行时间为23ms,通过参考给出的示例代码,发现自己忽略了employees的数据结构为list,没有利用充分利用这个数据结构,只把重心放在其数据类型Employee的构成。