[leetcode contest 582. Kill Process]week 14

一、题目

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.

二、思路

这道题用了队列的思想，遍历杀死的ppid数组，将所有父亲进程为初始杀的进程的值加入队列，同时引入一个判断数组add来判断该进程是否已被杀，若被杀则不加入队列，以减少时间复杂度。

三、代码

#include<algorithm>
#include<vector>
#include<queue>
#include<iostream> 
using namespace std;
class Solution {
public:
    vector<int> killProcess(vector<int>& pid, vector<int>& ppid, int kill) {
        bool add[1000000];
        vector<int> answer;
        queue<int> t;
        int temp = 0;
        answer.push_back(kill);

        for(int i=0;i<ppid.size();i++){
            if(kill==ppid[i]){
            t.push(pid[i]);

            }
            add[ppid[i]]=1;
        }
        while(!t.empty()){
            temp = t.front();
            if(!add[temp]){
                answer.push_back(temp);
                t.pop();
                continue;
            }
            for(int i=0;i<ppid.size();i++){
            if(temp==ppid[i]){
                t.push(pid[i]);
            }
        }
        answer.push_back(temp);
        t.pop();
        }   
        return answer;
    }
};