LeetCode.690 员工的重要性

原题

https://leetcode-cn.com/problems/employee-importance/

思路

使用map转存数据
递归/栈

题解

/*
// Definition for Employee.
class Employee {
    public int id;
    public int importance;
    public List<Integer> subordinates;
};
*/

class Solution {
    public int getImportance(List<Employee> employees, int id) {
        int res = 0;

        Map<Integer, Employee> map = new HashMap<Integer, Employee>();
        for (Employee employee : employees) {
            map.put(employee.id, employee);
        }

        Stack<Integer> stack = new Stack<>();
        Employee employee = map.get(id);
        List<Integer> children = employee.subordinates;
        res += employee.importance;
        for (Integer child : children) {
            stack.push(child);
        }

        while(!stack.isEmpty()){
            Employee emp = map.get(stack.pop());
            res += emp.importance;
            List<Integer> subordinates = emp.subordinates;
            for (Integer child : subordinates) {
                stack.push(child);
            }
        }

        return res;
    }
}

/*
// Definition for Employee.
class Employee {
    public int id;
    public int importance;
    public List<Integer> subordinates;
};
*/

class Solution {
    public int getImportance(List<Employee> employees, int id) {
        Map<Integer, Employee> map = new HashMap<Integer, Employee>();
        for (Employee employee : employees) {
            map.put(employee.id, employee);
        }

        return DFS(map, id);
    }

    private int DFS(Map<Integer, Employee> map, Integer id){
        Employee employee = map.get(id);
        List<Integer> subordinates = employee.subordinates;
        for (Integer child : subordinates) {
            employee.importance += DFS(map, child);
        }
        return employee.importance;
    }

}