LeetCode系列437—路径总和 III

题意

437. 路径总和 III

题解

方法一：深度优先搜索

每一个节点都执行rootSum函数，rootSum不同于pathSum的地方在于，路径必须连续

class Solution {
public:
    int rootSum(TreeNode* root, int targetSum) {
        if (root == nullptr) return 0;
        int ret = 0;
        if (root->val == targetSum) ret++;
        ret += rootSum(root->left, targetSum - root->val);
        ret += rootSum(root->right, targetSum - root->val);
        return ret;
    }

    int pathSum(TreeNode* root, int targetSum) {
        if (root == nullptr) return 0;
        return rootSum(root, targetSum) + pathSum(root->left, targetSum) + pathSum(root->right, targetSum);
    }
};

时间复杂度：O(n^2)
空间复杂度：O(n)

方法二：前缀和

class Solution {
public:
    unordered_map<long long, int> prefix;

    int dfs(TreeNode *root, long long curr, int targetSum) {
        if (!root) {
            return 0;
        }

        int ret = 0;
        curr += root->val;
        if (prefix.count(curr - targetSum)) {
            ret = prefix[curr - targetSum];
        }

        prefix[curr]++;
        ret += dfs(root->left, curr, targetSum);
        ret += dfs(root->right, curr, targetSum);
        prefix[curr]--;

        return ret;
    }

    int pathSum(TreeNode* root, int targetSum) {
        prefix[0] = 1;
        return dfs(root, 0, targetSum);
    }
};

作者：LeetCode-Solution
链接：https://leetcode-cn.com/problems/path-sum-iii/solution/lu-jing-zong-he-iii-by-leetcode-solution-z9td/
来源：力扣（LeetCode）
著作权归作者所有。商业转载请联系作者获得授权，非商业转载请注明出处。