You are given a data structure of employee information, which includes the employee's unique id, their importance value and their 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 their 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.
1 class Solution { 2 public int getImportance(List<Employee> employees, int id) { 3 int total = 0; 4 Map<Integer, Employee> map = new HashMap<>(); 5 for (Employee employee : employees) { 6 map.put(employee.id, employee); 7 } 8 Queue<Employee> queue = new LinkedList<>(); 9 queue.offer(map.get(id)); 10 while (!queue.isEmpty()) { 11 Employee current = queue.poll(); 12 total += current.importance; 13 for (int subordinate : current.subordinates) { 14 queue.offer(map.get(subordinate)); 15 } 16 } 17 return total; 18 } 19 } 20 21 22 23 24 class Solution { 25 public int getImportance(List<Employee> employees, int id) { 26 Map<Integer, Employee> map = new HashMap<>(); 27 for (Employee employee : employees) { 28 map.put(employee.id, employee); 29 } 30 return getImportanceHelper(map, id); 31 } 32 33 private int getImportanceHelper(Map<Integer, Employee> map, int rootId) { 34 Employee root = map.get(rootId); 35 int total = root.importance; 36 for (int subordinate : root.subordinates) { 37 total += getImportanceHelper(map, subordinate); 38 } 39 return total; 40 } 41 }