-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathEmployeeImportance.java
More file actions
62 lines (52 loc) · 1.67 KB
/
EmployeeImportance.java
File metadata and controls
62 lines (52 loc) · 1.67 KB
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 com.leetcode.map;
import java.util.*;
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> employeeMap = new HashMap<>();
for(Employee employee:employees){
employeeMap.put(employee.id, employee);
}
int ret =0;
Deque<Integer> queue = new ArrayDeque<>();
queue.add(id);
while (!queue.isEmpty()){
Integer employeeId = queue.poll();
Employee employee = employeeMap.get(employeeId);
if(employee!=null){
ret += employee.importance;
List<Integer> subordinates = employee.subordinates;
if(subordinates!=null){
subordinates.forEach((item)->queue.add(item));
}
}
}
return ret;
}
private int importance =0;
private Map<Integer, Employee> employeeMap = new HashMap<>();
public int getImportanceDfs(List<Employee> employees, int id) {
for(Employee employee:employees){
employeeMap.put(employee.id, employee);
}
dfs(id);
return importance;
}
private void dfs(int id){
Employee employee = employeeMap.get(id);
if(employee == null){
return;
}
importance +=employee.importance;
List<Integer> subordinates = employee.subordinates;
if(subordinates!=null){
for(Integer employeeId:subordinates){
dfs(employeeId);
}
}
}
}