dfs:
class Solution {
public int getImportance(List<Employee> employees, int id) {
int sum = 0;
for(int i = 0; i < employees.size();i++){
Employee emp = employees.get(i);
if(emp.id==id){
sum += emp.importance;
List<Integer> list = emp.subordinates;
for(int j = 0;j < list.size();j++){
sum += getImportance(employees,list.get(j));
}
break;
}
}
return sum;
}
}
实际上就是一种树的结构,求当前节点和它的子树所有节点的和。