437. 路径总和 III

/**
 * 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 {
private:
    int rtsum(TreeNode* root,int sum){  //计算包含根节点路径和
        if(!root)
            return 0;
        int res=0;  //路径数
        if(sum==root->val)
            res++;
        return res+rtsum(root->left,sum-root->val)+rtsum(root->right,sum-root->val);
    }
public:
    int pathSum(TreeNode* root, int sum) {
        if(!root)
            return 0;
        return rtsum(root,sum)+pathSum(root->left,sum)+pathSum(root->right,sum);
    }
};