Leetcode 797. All possible paths

797. All possible paths

class Solution:
    def allPathsSourceTarget(self, graph: List[List[int]]) -> List[List[int]]:
        result = []
        ans = []

        def dfs(i):
            if i == len(graph) - 1: 
                result.append(ans[:])
                return
            for j in graph[i]:
                ans.append(j)
                dfs(j)
                ans.pop()
        ans = [0]
        dfs(0)
        return result