(员工的重要性)----LeetCode

LeetCode -----690

一·解决方法就是递归与回溯

					//先介绍一个并未进行算法优化的解法

/*
// Definition for Employee.
class Employee {
    public int id;
    public int importance;
    public List<Integer> subordinates;
};
*/
class Solution {
    int sum;
    int count=1;
    List<List<Integer>> ID = new ArrayList<>();
    public int getImportance(List<Employee> employees, int id) {
        for(Employee e : employees){
            if(e.id == id){
                sum+=e.importance;
                ID.add(e.subordinates);
                if(ID.size() != 0){
                    DFS(employees,ID.get(0));
                }
                break;
            }
        }
        return sum;
    }
    public void DFS(List<Employee> employees,List<Integer> id){
        System.out.println(id);
        if(id.size() != 0) {
            for(int i = 0 ; i < id.size() ; i++){
                        for(int j = 0 ; j < employees.size() ; j++){
                            if(employees.get(j).id == id.get(i)){
                                sum+=employees.get(j).importance;  
                                ID.add(employees.get(j).subordinates);
                                DFS(employees,ID.get(count++));
                                break;
                            }
                }
            }  
        }
    }   
}