leetcode-Path Sum II

  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{
    vector<vector<int> > res;
    void helper(TreeNode *root,int left,vector<int> &base){
        if(!root->left&&!root->right){
            if(root->val==left){
                base.push_back(root->val);
                res.push_back(base);
                base.pop_back();
            }
            return ;    
        }
       
        if(root->left){
            base.push_back(root->val);
            helper(root->left, left-root->val,base);
            base.pop_back();
        }
        if(root->right){
            base.push_back(root->val);
            helper(root->right,left-root->val,base);
            base.pop_back();
        }    
    }
public:
    vector<vector<int>> pathSum(TreeNode* root, int sum) {
        if(!root)
            return res;
        vector<int> base;
        helper(root,sum,base);
        return res;
    }
};