582. Kill Process（Medium）

原题目：
　　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.

题目大意如下：
　　给定两个数组，一个代表程序的ID，另一个代表对应的程序的父进程的ID。现给定一个程序的ID，要求终止掉这个程序，需要注意，当终止掉一个进程的时候，它的子进程也会被终止掉。

解题思路：
　　将两个数组整合到一个邻接链表中，把进程间的父子关系表示出来。然后用BFS或DFS即可。

代码如下：

class Solution {
public:
    vector<int> killProcess(vector<int>& pid, vector<int>& ppid, int kill) {
        vector<vector<int>> son_list(50001 , vector<int>()) ;
        vector<int> ans ;
        for(int i = 0 ; i < pid.size() ; ++i)
            son_list[ppid[i]].push_back(pid[i]) ;
        ans.push_back(kill) ;
        queue<int> q ;
        q.push(kill) ;
        int temp ;
        while(!q.empty()){
            temp = q.front() ;
            q.pop() ;
            for(int i = 0 ; i < son_list[temp].size() ; ++i){
                ans.push_back(son_list[temp][i]) ;
                q.push(son_list[temp][i]) ;
            }
        }
        return ans ;
    }
};