121-path sum2

-113. Path Sum II QuestionEditorial Solution My Submissions
Total Accepted: 97778
Total Submissions: 323453
Difficulty: Medium
Given a binary tree and a sum, find all root-to-leaf paths where each path’s sum equals the given sum.

For 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]
]

/**
 * 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>> pathSum(TreeNode* root, int sum) {
        vector<vector<int>> res;
        vector<int> path;
        dfs(root,sum,path,res);
        return res;
    }
    void dfs(TreeNode* root,int sum,vector<int> &path,vector<vector<int>> &res)
    {
        if(root!=NULL){
            path.push_back(root->val);
            if(root->left==NULL&&root->right==NULL){
                    if(root->val==sum)res.push_back(path);
            }
            else {
                dfs(root->left,sum-root->val,path,res);
                dfs(root->right,sum-root->val,path,res);
            } 
            path.pop_back();
        }
    }
};