LeetCode-582. Kill Process (JAVA)杀死进程

582. Kill Process

Given n processes, each process has a unique PID (process id) and its PPID (parent process id).

Each process only has one parent process, but may have one or more children processes. This is just like a tree structure. Only one process has PPID that is 0, which means this process has no parent process. All the PIDs will be distinct positive integers.

We use two list of integers to represent a list of processes, where the first list contains PID for each process and the second list contains the corresponding PPID.

Now given the two lists, and a PID representing a process you want to kill, return a list of PIDs of processes that will be killed in the end. You should assume that when a process is killed, all its children processes will be killed. No order is required for the final answer.

Example 1:

Input: 
pid =  [1, 3, 10, 5]
ppid = [3, 0, 5, 3]
kill = 5
Output: [5,10]
Explanation: 
           3
         /   \
        1     5
             /
            10
Kill 5 will also kill 10.

Note:

1. The given kill id is guaranteed to be one of the given PIDs.
2. n >= 1.

树的边里，采用深度或者广度

public List<Integer> killProcess(List<Integer> pid, List<Integer> ppid, int kill) {
	// 采用邻接表存储
	HashMap<Integer, Node> map = new HashMap<>();
	for (Integer i : pid) {
		map.put(i, new Node(i));
	}

	for (int i = 0; i < ppid.size(); i++) {
		// map中为存储key为0的值
		if (ppid.get(i) != 0) {
			// 注意此时的逻辑
			map.get(ppid.get(i)).childs.add(map.get(pid.get(i)));
		}
	}
	List<Integer> res = new ArrayList<>();
	// 深度优先遍历
	dfs(map.get(kill), res);
	return res;
}

public void dfs(Node node, List<Integer> res) {
	if (node == null)
		return;
	res.add(node.id);
	for (Node n : node.childs) {
		dfs(n, res);
	}
}

private class Node {
	private Integer id;
	private List<Node> childs;

	public Node(Integer id) {
		this.id = id;
		this.childs = new ArrayList<>();
	}
}

以下来源discuss：https://discuss.leetcode.com/topic/89287/java-dfs-o-n-time-o-n-space

put与putIfAbsent区别，put在放入数据时，如果放入数据的key已经存在与Map中，最后放入的数据会覆盖之前存在的数据，而putIfAbsent在放入数据时，如果存在重复的key，那么putIfAbsent不会放入值。

public List<Integer> killProcess(List<Integer> pid, List<Integer> ppid, int kill) {

	// Store process tree as an adjacency list
	Map<Integer, List<Integer>> map = new HashMap<>();
	for (int i = 0; i < ppid.size(); i++) {
		
		map.putIfAbsent(ppid.get(i), new LinkedList<>());
		map.get(ppid.get(i)).add(pid.get(i));
	}

	// Kill all processes in the subtree rooted at process "kill"
	List<Integer> res = new LinkedList<>();
	Stack<Integer> stack = new Stack<>();
	stack.add(kill);
	while (!stack.isEmpty()) {
		int cur = stack.pop();
		res.add(cur);
		List<Integer> list = map.get(cur);
		if (list == null)
			continue;
		stack.addAll(list);
	}
	return res;

}