leetcode113. 路径总和 II

1、题目

https://leetcode-cn.com/problems/path-sum-ii/submissions/

2、题意

题解1：dfs回溯 和上一题leetcode112类似

class Solution {
public:
    vector<vector<int>> res;
    vector<int> path;
    void dfs(TreeNode* root, int sum)
    {
        path.push_back(root->val);
        if(!root->left&&!root->right&&sum==root->val)
            res.push_back(path);
        else
        {
            if(root->left)
                dfs(root->left,sum-root->val);
            if(root->right)
                dfs(root->right,sum-root->val);
        }
        path.pop_back();
    }
    vector<vector<int>> pathSum(TreeNode* root, int sum) {
        if(root) dfs(root,sum);
        return res;
    }

};