leetcode: 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.

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 binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
    
    void pathSumInt(TreeNode *root, int remainSum, vector<int> &curVector, vector<vector<int>> &retVector)
    {
        if (!root)
            return;
        
        curVector.push_back(root->val);
        
        int curRemainSum = remainSum - root->val;
        if (curRemainSum == 0 && root->left == NULL && root->right == NULL)
        {
            retVector.push_back(curVector);
            curVector.pop_back();
            
            return;
        }
        
        pathSumInt(root->left, curRemainSum, curVector, retVector);
        pathSumInt(root->right, curRemainSum, curVector, retVector);
        
        curVector.pop_back();    
    }
    
public:
    vector<vector<int> > pathSum(TreeNode *root, int sum) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        
        vector<vector<int>> retVector;
        
        if (!root)
            return retVector;
            
        vector<int> curVector;
            
        pathSumInt(root, sum, curVector, retVector);
        
        return retVector;
    }
};