994. 腐烂的橘子（Medium）/ 582. 杀死进程（M）/ 二维矩阵DFS、BFS、并查集问题

• 73. 矩阵置零（Medium）
• 130. 被围绕的区域（Medium）
• 934. 最短的桥（Medium）
• 547. 省份数量、朋友圈（Medium）
• 684. 冗余连接（Medium）
  
• 题解
  
  

class Solution:
	# BFS
    def orangesRotting(self, grid: List[List[int]]) -> int:
        row, col, time = len(grid), len(grid[0]), 0
        directions = [(1, 0), (-1, 0), (0, 1), (0, -1)]
        queue = []
        # 把腐烂橘子的坐标入队
        for i in range(row):
            for j in range(col):
                if grid[i][j] == 2:
                    queue.append((i, j, time))

        # bfs
        while queue:
            i, j, time = queue.pop(0)
            for di, dj in directions:
                if 0 <= i + di < row and 0 <= j + dj < col and grid[i + di][j + dj] == 1:
                    grid[i + di][j + dj] = 2 # 把腐烂橘子邻近的新鲜橘子变成腐烂橘子
                    queue.append((i + di, j + dj, time + 1))

        # 如果还有新鲜橘子，就返回-1
        for row in grid:
            if 1 in row: return -1

        return time

582. 杀死进程

• 知乎题解
• 根据题目给出的父子关系建立有向图，然后从kill节点开始向下进行bfs，遍历到的所有进程都是会连带被杀掉的进程，而bfs的队列q就是最终答案

class Solution(object):
    def killProcess(self, pid, ppid, kill):
        """
        :type pid: List[int]
        :type ppid: List[int]
        :type kill: int
        :rtype: List[int]
        """

        childs = {}
        for x, y in zip(pid, ppid):
            if y not in childs:
                childs[y] = []
            childs[y].append(x)

        q = [kill]
        head, tail = 0, 1
        while head < tail:
            now = q[head]
            head += 1
            for next in childs.get(now, []):
                q.append(next)
                tail += 1
        
        return q