題目：797. 所有可能的路徑

思路

深度搜索

代碼

// 圖論哦!class Solution {
private:vector<vector<int>> result;vector<int> path;// x : 當前節點void function(vector<vector<int>>& graph, int x){int i;// cout << ", x : " << x;if(x == graph.size()-1) // 節點 n-1{result.push_back(path);return;}for(i = 0; i < graph[x].size(); i++){// cout << ", i : " << i; path.push_back(graph[x][i]);function(graph, graph[x][i]);path.pop_back();}cout << endl;}public:vector<vector<int>> allPathsSourceTarget(vector<vector<int>>& graph) {result.clear();path.clear();path.push_back(0);function(graph, 0);return result;}
};

注意要往path提前塞進去一個0哦；