【LeetCode】113. Path Sum II

Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.

Note: A leaf is a node with no children.

Example:

Given the below binary tree and sum = 22,

      5
     / \
    4   8
   /   / \
  11  13  4
 /  \    / \
7    2  5   1

Return:

[
   [5,4,11,2],
   [5,8,4,5]
]

题解：直接dfs即可，每次遇到叶节点时就判断一下是否和等于sum，如果则加入ans中，这里开始犯错是在root为空时才判断从而加了两次（因为左右都为空）

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