leetcode之Path Sum II

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    bool sumCore(TreeNode *root, int sum, vector<vector<int> >& res, vector<int> a) {
        if (root==NULL) {
            return false;
        }
        int nextSum = sum-root->val;
        a.push_back(root->val);
        if (nextSum==0 && root->left==NULL && root->right==NULL) {
            res.push_back(a);
           // a.clear();
            return true;
        }
        bool leftSum = sumCore(root->left, nextSum, res, a);
        bool rightSum = sumCore(root->right, nextSum, res, a);
        if (leftSum||rightSum) {
            return true;
        } else {
            return false;
        }
    }
    vector<vector<int> > pathSum(TreeNode *root, int sum) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        vector<vector<int> > res;
        if (root==NULL) {
            return res;
        }
        vector<int> a;
        sumCore(root, sum, res, a);
        return res;
    }
};