437. Path Sum III

https://leetcode.com/problems/path-sum-iii/

1. 思路

采用自身递归，思路可以很清晰。给定root->val和目标sum值，可能的path sum有五种：

• 若root->val == sum，则root->val本身是一个路径
• 不考虑root->val包含在path sum中，从root->left和root->right中获得sum，得到两种可能的path sum
• 考虑root->val包含在path sum中，从root->left和root->right中获得sum-root->val，得到另外两种可能的path sum。需要注意的是这种情况下path sum必须是连续的

2. AC代码

/**
 * 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 {
public:
    int pathSum(TreeNode* root, int sum) {
        if(root == NULL) return 0;
        return (root->val == sum) + pathSum_help(root->left, sum, false) + pathSum_help(root->right, sum, false) + pathSum_help(root->left, sum-root->val, true) + pathSum_help(root->right, sum-root->val, true);
    }
    int pathSum_help(TreeNode* root, int sum, bool must_root){
        if(root == NULL) return 0;
        if(must_root)
            return (root->val == sum) + pathSum_help(root->left, sum-root->val, true) + pathSum_help(root->right, sum-root->val, true);
        else
            return (root->val == sum) + pathSum_help(root->left, sum-root->val, true) + pathSum_help(root->right, sum-root->val, true) + pathSum_help(root->left, sum, false) + pathSum_help(root->right, sum, false);
    }
    
};