lc797.所有可能的路径

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23

class Solution {
public:
    vector<vector<int>> res;
    void dfs(vector<vector<int>>& g, int begin, vector<int>& path, int n ){
        if(begin == n){
            res.push_back(path);
            return;
        }
        for(int i = 0; i < g[begin].size(); i++){
            path.push_back(g[begin][i]);
            dfs(g, g[begin][i], path, n);
            path.pop_back();
        }
    }
    vector<vector<int>> allPathsSourceTarget(vector<vector<int>>& graph) {
        vector<int> path;
        int n = graph.size() - 1;
        path.push_back(0);
        dfs(graph, 0, path, n);

        return res;
    }
};