20170529-leetcode-582-Kill process

来源:互联网 发布:p2p网络摄像机软件使用 编辑:程序博客网 时间:2024/06/06 12:24

1.Description

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:
The given kill id is guaranteed to be one of the given PIDs.
n >= 1.
解读
给定一个进程列表,和该列表对应的父进程列表,输入要杀掉的进程,输出所有将要结束的进程

2.Solution

#代码来自leecode,简洁明了,下面做一下分析class Solution(object):    def killProcess(self, pid, ppid, kill):        d = collections.defaultdict(list)        #建立pid,ppid的对应表,如pid=[0,1,2,3,4,5],ppid=[0,1,1,1,1]        #通过下面的代码得到map{0:[0],1:[2,3,4,5]}        for c, p in zip(pid, ppid): d[p].append(c)        bfs = [kill]#最后的BFS结果中第一个元素是kill        for i in bfs: bfs.extend(d.get(i, []))#把结果的子进程添加进来        return bfs