[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:
The given kill id is guaranteed to be one of the given PIDs.
n >= 1.
思路:
用一个map去对应父节点与它的所有子节点,map<int,set<int>>。子节点放到set里面。
然后用深度优先遍历的方法去遍历。DFS。
void killCore(map<int, set<int>>& nodes, vector<int>& ret, int kill)
{
ret.push_back(kill);
//set<int>::iterator it;
//for (it = nodes[kill].begin(); it != nodes[kill].end();it++)
//{
// killCore(nodes, ret, *it);
//}
for (int child : nodes[kill])
{
killCore(nodes, ret, child);
}
}
vector<int> killProcess(vector<int>& pid, vector<int>& ppid, int kill)
{
vector<int> ret;
map<int,set<int>> nodes;//每一个父结点对应的子结点
for (int i = ; i < pid.size();i++)
{
nodes[ppid[i]].insert(pid[i]);
}
killCore(nodes, ret, kill); return ret;
}
参考:
https://leetcode.com/problems/kill-process/#/solutions
最新文章
- 在IIS启用MP4
- mybaits注解
- go-martini 简单分析之一
- Docker Compose—简化复杂容器应用的利器
- Java并发大师Brain Goetz和Doug Lea 的中英文博客文章地址
- Jquery调用Webservice传递Json数组
- asp 301跳转代码
- Erlang入门(一)
- SQL日期(转)
- Android XML解析
- 网页Gzip
- vim命令杂记
- 四轴飞行器1.7 NRF24L01P无线通讯和改进型环形缓冲
- 利用Jsoup包爬取网站内容
- GET和POST传送数据的限制
- [转]Nodejs进程间通信
- 【SpringBoot】SpringBoot拦截器实战和 Servlet3.0自定义Filter、Listener
- MySQL 之【视图】【触发器】【存储过程】【函数】【事物】【数据库锁】【数据库备份】
- noip 提高组 2010
- js深复制