forked from neetcode-gh/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path1376-time-needed-to-inform-all-employees.java
40 lines (31 loc) · 1.3 KB
/
1376-time-needed-to-inform-all-employees.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
class Solution {
public int numOfMinutes(int n, int headID, int[] manager, int[] informTime) {
Map<Integer, List<Integer>> adjacentMap = prepareAdjacentMap(headID, manager);
int time = 0;
Deque<Pair<Integer, Integer>> deque = new ArrayDeque<>();
deque.addFirst(new Pair<>(headID, informTime[headID]));
while (!deque.isEmpty()) {
Pair<Integer, Integer> curManager = deque.pollLast();
time = Math.max(time, curManager.getValue());
if (adjacentMap.containsKey(curManager.getKey())) {
for (Integer employee : adjacentMap.get(curManager.getKey())) {
deque.addFirst(new Pair<>(employee, curManager.getValue() + informTime[employee]));
}
}
}
return time;
}
private Map<Integer, List<Integer>> prepareAdjacentMap(int headId, int[] manager) {
Map<Integer, List<Integer>> adjacentMap = new HashMap<>();
for (int i = 0; i < manager.length; i++) {
if (i == headId) {
continue;
}
if (!adjacentMap.containsKey(manager[i])) {
adjacentMap.put(manager[i], new ArrayList<>());
}
adjacentMap.get(manager[i]).add(i);
}
return adjacentMap;
}
}