Leetcode 113, Path Sum II,难度medium
这道题跟112也是相似的,但是这道题需要输出符合的序列,但是仍然可以在112的基础上修改就可以了,需要记录已经经过的路径,然后作为递归函数的参数传递,最后判断是否符合题目条件然后压入vector中。
以下是代码
class Solution {
public:
vector<vector<int>> pathSum(TreeNode* root, int sum) {
vector<vector<int>> res;
vector<int> count;
int x = 0;
if(root == NULL) return res;
DFS(root, res, count, x, sum);
return res;
}
void DFS(TreeNode* root, vector<vector<int>>& res, vector<int> count, int x, int sum) {
x += root -> val;
count.push_back(root -> val);
if(root -> right == NULL && root -> left == NULL && x == sum) {
res.push_back(count);
return;
}
if(root -> left != NULL) DFS(root ->left, res, count, x, sum);
if(root -> right != NULL) DFS(root -> right, res, count, x, sum);
}
};