-
Notifications
You must be signed in to change notification settings - Fork 1
/
LeetCode-582-Kill-Process.java
53 lines (42 loc) · 1.71 KB
/
LeetCode-582-Kill-Process.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
class Solution {
// // 1. BFS
// public List<Integer> killProcess(List<Integer> pid, List<Integer> ppid, int kill) {
// HashMap<Integer, Set<Integer>> map = new HashMap<>(); // <pid, children set>
// for (int i = 0; i < pid.size(); i++) {
// map.computeIfAbsent(ppid.get(i), k -> new HashSet<>()).add(pid.get(i));
// }
// List<Integer> res = new ArrayList<>();
// Queue<Integer> queue = new LinkedList<>();
// queue.offer(kill);
// while (!queue.isEmpty()) {
// int size = queue.size();
// for (int i = 0; i < size; i++) {
// int curr = queue.poll();
// res.add(curr);
// if (map.containsKey(curr)) {
// for (int p : map.get(curr)) {
// queue.offer(p);
// }
// }
// }
// }
// return res;
// }
// 2. DFS
public List<Integer> killProcess(List<Integer> pid, List<Integer> ppid, int kill) {
HashMap<Integer, Set<Integer>> map = new HashMap<>(); // <pid, children set>
for (int i = 0; i < pid.size(); i++) {
map.computeIfAbsent(ppid.get(i), k -> new HashSet<>()).add(pid.get(i));
}
List<Integer> res = new ArrayList<>();
recursive(map, kill, res);
return res;
}
private void recursive(HashMap<Integer, Set<Integer>> map, int curr, List<Integer> res) {
res.add(curr);
if (!map.containsKey(curr)) return;
for (int p : map.get(curr)) {
recursive(map, p, res);
}
}
}