原题目:https://leetcode-cn.com/problems/all-paths-from-source-to-target/
思路:
使用BFS + 回溯算法
代码:
class Solution {
vector<vector<int>> ans;
vector<int> tmp;
void bfs(vector<vector<int>>& graph,int index){
tmp.push_back(index);
if(index == graph.size()-1){
ans.push_back(tmp);
tmp.pop_back();
return;
}
for(int i=0;i<graph[index].size();i++){
bfs(graph,graph[index][i]);
}
tmp.pop_back();
}
public:
vector<vector<int>> allPathsSourceTarget(vector<vector<int>>& graph) {
bfs(graph,0);
return ans;
}
};