[Leetcode] 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.

思路：

由于整个进程关系形成了一棵树，所以我们首先建立一个哈希表，表示parent->children之间的映射关系，这样就可以在O(1)的时间内得到一个进程的所有孩子进程。然后就就可以用DFS也可以用BFS来搜索一个父进程的所有孩子了。这里我们用了BFS，也就是用一个队列来存储所有待处理的结点。每次处理的时候，首先将队列头部的结点加入结果集中，并删除头部结点；然后将其所有孩子结点加入队列中。当队列为空时，就可以返回结果了。

代码：

class Solution {
public:
    vector<int> killProcess(vector<int>& pid, vector<int>& ppid, int kill) {
        vector<int> ret;
        unordered_map<int, vector<int>> hash;   // map from parent to children
        for (int i = 0; i < pid.size(); ++i) {
            hash[ppid[i]].push_back(pid[i]);
        }
        queue<int> q;
        q.push(kill);
        while (!q.empty()) {
            kill = q.front();
            q.pop();
            ret.push_back(kill);
            for (auto it = hash[kill].begin(); it != hash[kill].end(); ++it) {
                q.push(*it);
            }
        }
        return ret;
    }
};