深度优先搜索

class Solution {
private:vector<vector<int>> result;vector<int> temp;void allPathsSourceTarget(vector<vector<int>> &graph,int v){if(v==graph.size()-1)result.push_back(temp);else{for(auto& adjVertex:graph[v]){temp.push_back(adjVertex);allPathsSourceTarget(graph,adjVertex);temp.pop_back();}}}public:vector<vector<int>> allPathsSourceTarget(vector<vector<int>>& graph) {result.clear();temp.push_back(0);allPathsSourceTarget(graph,0);temp.pop_back();return result;}
};