leetcode113——Path SumⅡ

题目大意：找到所有从根节点到叶子节点路径总和等于给定目标和的路径。

代码：

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    vector<vector<int>> ans;
    vector<int> tmp;
    vector<vector<int>> pathSum(TreeNode* root, int sum) {
        dfs(root,sum);
        return ans;
    }
    void dfs(TreeNode* root,int sum){
        if(root == NULL) return;
        tmp.push_back(root->val);
        if(sum == root->val && root->left == NULL && root->right == NULL){
            ans.push_back(tmp);
        }
        else{
            dfs(root->left,sum - root->val);
            dfs(root->right,sum - root->val);
        }
        tmp.pop_back();
    }
};