class Solution {
public:
vector<vector<int>> allPathsSourceTarget(vector<vector<int>>& graph) {
vector<vector<int>> res;
vector<int> out={0};
int n=graph.size();
helper(graph, n, 0, out, res);
return res;
}
void helper(vector<vector<int>>& graph, int size, int i, vector<int>& out, vector<vector<int>>& res){
if(i==size-1){
res.push_back(out);
return;
}
for(int k:graph[i]){
out.push_back(k);
helper(graph, size, k, out, res);
out.pop_back();
}
}
};
Leetcode 797. All Paths From Source to Target
最新推荐文章于 2023-05-20 21:22:26 发布