给定进程ID和父进程ID数组，当一个进程被杀掉时，其所有子进程也会被杀掉。你需要找到所有将被终止的进程ID。构建进程树并进行广度优先搜索以获取受影响的进程。
You have n processes forming a rooted tree structure. You are given two integer arrays pid and ppid, where pid[i] is the ID of the ith process and ppid[i] is the ID of the ith process's parent process.
Each process has only one parent process but may have multiple children processes. Only one process has ppid[i] = 0, which means this process has no parent process (the root of the tree).
When a process is killed, all of its children processes will also be killed.
Given an integer kill representing the ID of a process you want to kill, return a list of the IDs of the processes that will be killed. You may return the answer in any order.
Example 1:
最低0.47元/天 解锁文章
837
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
