690. Employee Importance

690. 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.

• 题目大意：给定一个雇佣的数据结构，包含个人id，个人权重，下属id，给定一个数组，一个id，找出该id及其下属的所有数据结构。

• 思路：DFS

• 代码

  package HashTable;
  
  import java.util.HashMap;
  import java.util.List;
  import java.util.Map;
  
  /**
  * @author OovEver
  * 2018/1/11 13:11
  */
  public class LeetCode690 {
    // 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;
    }
    public int getImportance(List<Employee> employees, int id) {
        Map<Integer, Employee> map = new HashMap<>();
        for (Employee employee : employees) {
            map.put(employee.id, employee);
        }
        return helper(map, id);
    }
  
    private int helper(Map<Integer, Employee> map, int rootId) {
        Employee root = map.get(rootId);
        int total = root.importance;
        for (int subordinate : root.subordinates) {
            total += helper(map, subordinate);
        }
        return total;
    }
  }