LeetCode-797. All Paths From Source to Target

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 v2--->3There 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: void dfs(vector>& graph, int k, int n, vector &cur, vector> &res) { if (k == n) { res.push_back(cur); } else { for (int i = 0; i < graph[k].size(); i++) { cur.push_back(graph[k][i]); dfs(graph, graph[k][i], n, cur, res); cur.pop_back(); } } } vector> allPathsSourceTarget(vector>& graph) { int n = graph.size(); vector> res; vector cur(1, 0); dfs(graph, 0, n - 1, cur, res); return res; }};

版权声明：本文内容由网络用户投稿，版权归原作者所有，本站不拥有其著作权，亦不承担相应法律责任。如果您发现本站中有涉嫌抄袭或描述失实的内容，请联系我们jiasou666@gmail.com 处理，核实后本网站将在24小时内删除侵权内容。