113. 路径总和 II

这题主要考察的是dfs 弄清每层递归里面的re里面的值 是此题的关键

 

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