목록797. All Paths From Source to Target (1)

Byte by Byte

797. All Paths From Source to Target.cpp

Graph -> dfs (depth first search) class Solution { public: int target; vector res; vector tmp; void dfs(vector& graph, int currNode = 0) { tmp.push_back(currNode); if (currNode == target) res.push_back(tmp); else { for (int node: graph[currNode]) { dfs(graph, node); } } } vector allPathsSourceTarget(vector& graph) { target = graph.size() - 1; dfs(graph); return res; } };
개발 로그/알고리즘 2021. 9. 30. 12:21
이전 Prev 1 Next 다음