-
Notifications
You must be signed in to change notification settings - Fork 2
/
EmployeeImportance.java
62 lines (54 loc) · 2.05 KB
/
EmployeeImportance.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
package Leetcode;
import java.util.*;
/**
* 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.
*
*
* Note:
* One employee has at most one direct leader and may have several subordinates.
* The maximum number of employees won't exceed 2000.
*
*/
public class EmployeeImportance {
class Employee {
public int id;
public int importance;
public List<Integer> subordinates;
};
public int getImportance(List<Employee> employees, int id) {
Map<Integer, Employee> map = new HashMap<>();
Queue<Employee> queue = new LinkedList<>();
int result = 0;
// build the map
for(Employee emp : employees) {
map.put(emp.id, emp);
}
queue.offer(map.get(id));
// Perform Level order traversal
while(!queue.isEmpty() || queue.size() > 0) {
Employee currentEmployee = queue.poll();
result += currentEmployee.importance;
for(Integer subordinate : currentEmployee.subordinates) {
queue.offer(map.get(subordinate));
}
}
return result;
}
}