0802 Find Eventual Safe States

0802 Find Eventual Safe States.py

class Solution:
    def eventualSafeNodes(self, graph: List[List[int]]) -> List[int]:
        
        def dfs(curr, vis, path):
            vis[curr] = 1
            path[curr] = 1
            for u in graph[curr]:
                if vis[u] == 0:
                    if dfs(u, vis, path):
                        return True
                elif path[u]:
                    return True
            path[curr] = 0
            return False
       
        n = len(graph)
        vis = [0] * n
        path = [0] * n
        res = []
        
        for i in range(n):
            if vis[i] == 0:
                dfs(i, vis, path)
        
        for i in range(n):
            if path[i] == 0:
                res.append(i)       
        
        return res