LeetCode797

题目
https://leetcode.com/problems/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.

solution:
dfs

public List<List<Integer>> allPathsSourceTarget(int[][] graph) {
        List<List<Integer>> sol = new ArrayList<>();
        List<Integer> path = new ArrayList<>();
        path.add(0);
        return helper(graph, 0, sol, path);
    }
    
    private List<List<Integer>> helper(int[][] graph, int s, List<List<Integer>> sol, List<Integer> path) {
        for (int end : graph[s]) {
            path.add(end);
            if (end == graph.length - 1) {
                sol.add(new ArrayList<Integer>(path));
            }
            else {
                helper(graph, end, sol, path);
            }
            path.remove(path.size() - 1);
        }
        return sol;
    }

复杂度：
n: number of nodes
Time: O(n ^ n)
Space: O(n)