leetcode - 802. Find Eventual Safe States

Description

There is a directed graph of n nodes with each node labeled from 0 to n - 1. The graph is represented by a 0-indexed 2D integer array graph where graph[i] is an integer array of nodes adjacent to node i, meaning there is an edge from node i to each node in graph[i].

A node is a terminal node if there are no outgoing edges. A node is a safe node if every possible path starting from that node leads to a terminal node (or another safe node).

Return an array containing all the safe nodes of the graph. The answer should be sorted in ascending order.

Example 1:

复制代码
Illustration of graph
Input: graph = [[1,2],[2,3],[5],[0],[5],[],[]]
Output: [2,4,5,6]
Explanation: The given graph is shown above.
Nodes 5 and 6 are terminal nodes as there are no outgoing edges from either of them.
Every path starting at nodes 2, 4, 5, and 6 all lead to either node 5 or 6.

Example 2:

复制代码
Input: graph = [[1,2,3,4],[1,2],[3,4],[0,4],[]]
Output: [4]
Explanation:
Only node 4 is a terminal node, and every path starting at node 4 leads to node 4.

Constraints:

复制代码
n == graph.length
1 <= n <= 10^4
0 <= graph[i].length <= n
0 <= graph[i][j] <= n - 1
graph[i] is sorted in a strictly increasing order.
The graph may contain self-loops.
The number of edges in the graph will be in the range [1, 4 * 10^4].

Solution

Topological sort. If we start from the terminal node, and remove its edges, then the next terminal node would be safe node. So this is actually a topological sort problem.

Time complexity: o ( e d g e s + n o d e s ) o(edges + nodes) o(edges+nodes)

Space complexity: o ( e d g e s + n o d e s ) o(edges + nodes) o(edges+nodes)

Code

python3 复制代码
class Solution:
    def eventualSafeNodes(self, graph: List[List[int]]) -> List[int]:
        def build_graph(edges: list) -> tuple:
            graph = {i: [] for i in range(len(edges))}
            outdegree = {i: 0 for i in range(len(edges))}
            for i in range(len(edges)):
                for next_node in edges[i]:
                    graph[next_node].append(i)
                    outdegree[i] += 1
            return graph, outdegree
        # new_graph: {node: [node that points to this node]}
        # outdegree: {node: out_degree}
        new_graph, outdegree = build_graph(graph)
        queue = collections.deque([])
        res = set()
        for each_node in new_graph:
            if outdegree[each_node] == 0:
                queue.append(each_node)
        while queue:
            node = queue.popleft()
            if node in res:
                continue
            res.add(node)
            for neighbor_node in new_graph[node]:
                outdegree[neighbor_node] -= 1
                if outdegree[neighbor_node] == 0:
                    queue.append(neighbor_node)
        return list(sorted(res))
相关推荐
??tobenewyorker25 分钟前
力扣打卡第二十一天 中后遍历+中前遍历 构造二叉树
数据结构·c++·算法·leetcode
贾全1 小时前
第十章:HIL-SERL 真实机器人训练实战
人工智能·深度学习·算法·机器学习·机器人
GIS小天1 小时前
AI+预测3D新模型百十个定位预测+胆码预测+去和尾2025年7月4日第128弹
人工智能·算法·机器学习·彩票
满分观察网友z1 小时前
开发者的“右”眼:一个树问题如何拯救我的UI设计(199. 二叉树的右视图)
算法
森焱森3 小时前
无人机三轴稳定化控制(1)____飞机的稳定控制逻辑
c语言·单片机·算法·无人机
循环过三天3 小时前
3-1 PID算法改进(积分部分)
笔记·stm32·单片机·学习·算法·pid
闪电麦坤953 小时前
数据结构:二维数组(2D Arrays)
数据结构·算法
凌肖战3 小时前
力扣网C语言编程题:快慢指针来解决 “寻找重复数”
c语言·算法·leetcode
埃菲尔铁塔_CV算法4 小时前
基于 TOF 图像高频信息恢复 RGB 图像的原理、应用与实现
人工智能·深度学习·数码相机·算法·目标检测·计算机视觉
NAGNIP5 小时前
一文搞懂FlashAttention怎么提升速度的?
人工智能·算法