[LeetCode] Path Sum II

class Solution {public:    vector<vector<int> > result;    vector<vector<int> > pathSum(TreeNode *root, int sum) {        vector<int> v;        check(root,sum,0,v);        return result;    }    void check(TreeNode *root,int sum,int curSum,vector<int> v){        if(root == NULL)            return;        if(root -> left == NULL && root ->right == NULL && curSum + root -> val == sum){            v.push_back(root -> val);            result.push_back(v);            return;        }        v.push_back(root -> val);        check(root -> left,sum,curSum + root -> val,v);        check(root -> right,sum,curSum + root -> val,v);    }};