Leetcode 437. Path Sum III (二叉树遍历和前缀和好题)

437. Path Sum III
     Medium
     Given the root of a binary tree and an integer targetSum, return the number of paths where the sum of the values along the path equals targetSum.

The path does not need to start or end at the root or a leaf, but it must go downwards (i.e., traveling only from parent nodes to child nodes).

Example 1:

Input: root = [10,5,-3,3,2,null,11,3,-2,null,1], targetSum = 8
Output: 3
Explanation: The paths that sum to 8 are shown.
Example 2:

Input: root = [5,4,8,11,null,13,4,7,2,null,null,5,1], targetSum = 22
Output: 3

Constraints:

The number of nodes in the tree is in the range [0, 1000].
-109 <= Node.val <= 109
-1000 <= targetSum <= 1000

解法1： 遍历。时间复杂度O(n*n)。

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    int pathSum(TreeNode* root, int targetSum) {
        if (!root) return 0;
        int res = 0;
        helper(root, targetSum, 0, res);
        res += pathSum(root->left, targetSum) + pathSum(root->right, targetSum);
        return res;
    }
private:
    void helper(TreeNode *root, int targetSum, long long sum, int &res) {
        if (!root) return;
        sum += root->val;
        if ((long long)targetSum == sum) {
            res++;
        }
        helper(root->left, targetSum, sum, res);
        helper(root->right, targetSum, sum, res);
    }
};

解法2：
这题最好的做法应该是用前缀和+遍历，时间复杂度是O(n)。这个方法很重要！

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    int pathSum(TreeNode* root, int targetSum) {
        if (!root) return 0;
        um[0] = 1;
        helper(root, targetSum, 0);
        return count;
    }
private:
    unordered_map<long long, int> um; //<presum, count>
    int count = 0;
    void helper(TreeNode *root, int targetSum, long long sum) {
        if (!root) return;
        sum += root->val;
        count += um[sum - targetSum];
        um[sum]++;
        helper(root->left, targetSum, sum);
        helper(root->right, targetSum, sum);
        um[sum]--; //一定要注意在post-order这个地方把um[sum]--，因为已经离开这个节点了！
    }
};