leetcode algorithm 797. All Paths From Source to Target

问题描述

Given a directed, acyclic graph of N nodes. Find all possible paths from node 0 to node N-1, and return them in any order.
The graph is given as follows: the nodes are 0, 1, …, graph.length - 1. graph[i] is a list of all nodes j for which the edge (i, j) exists.

Example:
Input: [[1,2], [3], [3], []]
Output: [[0,1,3],[0,2,3]]
Explanation: The graph looks like this:
0—>1
| |
v v
2—>3
There are two paths: 0 -> 1 -> 3 and 0 -> 2 -> 3.

理解

找到从0到N-1的所有路径（因为题目里涉及的图不成环，所以下面dfs中没有加入已访问节点的判断过程）

代码

class Solution {
	//深度优先搜索遍历图
    public void dfs(List<List<Integer>> allPaths,List<Integer> path, int[][] graph, int target){
        path.add(target);
        //遍历到目标节点即找到一条路径
        if(target == graph.length - 1)
            allPaths.add(path);
        else {
        	//未找到目标节点 继续搜索相邻节点
            for(int i = 0;i < graph[target].length;i++){
                dfs(allPaths, new ArrayList(path), graph, graph[target][i]);
            }
        }
    }
    public List<List<Integer>> allPathsSourceTarget(int[][] graph) {
        List<List<Integer>> allPaths = new ArrayList<List<Integer>>();
        List<Integer> path = new ArrayList<Integer>();
        dfs(allPaths, path, graph, 0);
        return allPaths;
    }
}

dfs 循环递归的时候path 的值好像会冲突 改成

(List)path.clone()

不知道为啥编译不通过