LeetCode 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.

Note:

• The number of nodes in the graph will be in the range [2, 15].
• You can print different paths in any order, but you should keep the order of nodes inside one path.

解题思路

深搜

代码

class Solution {
public:
    vector<vector<int>> paths;

    void findPath(vector<vector<int>> &graph, vector<int> path, int x, int target) {
        if (x == target)
            paths.emplace_back(path);
        for (auto each: graph[x]) {
            auto tmp = path;
            tmp.push_back(each);
            findPath(graph, tmp, each, target);
        }
    }

    vector<vector<int>> allPathsSourceTarget(vector<vector<int>> &graph) {
        paths.clear();
        int N = (int) graph.size();
        findPath(graph, vector<int>{0}, 0, N - 1);
        return paths;
    }
};