112. Path Sum（C语言）

112. Path Sum（C语言）

二叉树的“向下加和，向上反馈判断”

题目

Given the root of a binary tree and an integer targetSum, return true if the tree has a root-to-leaf path such that adding up all the values along the path equals targetSum.

A leaf is a node with no children.

Example 1:
Input: root = [5,4,8,11,null,13,4,7,2,null,null,null,1], targetSum = 22
Output: true
Explanation: The root-to-leaf path with the target sum is shown.

Example 2:
Input: root = [1,2,3], targetSum = 5
Output: false
Explanation: There two root-to-leaf paths in the tree:
(1 --> 2): The sum is 3.
(1 --> 3): The sum is 4.
There is no root-to-leaf path with sum = 5.

Example 3:
Input: root = [], targetSum = 0
Output: false
Explanation: Since the tree is empty, there are no root-to-leaf paths.

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

解答

递归的方法，向下加和，向上反馈判断

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     struct TreeNode *left;
 *     struct TreeNode *right;
 * };
 */
bool Tra(struct TreeNode* root, int targetSum, int sum)
{
    if(root == NULL)
    {
        if(sum == targetSum)
            return true;
        else 
            return false;
    }
    
    sum += root->val;
    bool left = Tra(root->left, targetSum, sum);
    bool right = Tra(root->right, targetSum, sum);
    if(root->left == NULL && root->right != NULL)
        left = false;
    if(root->left != NULL && root->right == NULL) 
        right = false;

    if(left || right)
        return true;
    else 
        return false;
}
bool hasPathSum(struct TreeNode* root, int targetSum){
    int sum = 0;
    if(root == NULL) return false;
    return Tra(root, targetSum, sum);
}

总结

用递归的方法，向下加和，在叶子节点的下一层处判断是否符合，再将判断的结果向上传递。
要注意的问题：与“求二叉树的最小深度”相似，关注一个节点的左子树为NULL，右子树不为NULL时的情况，反之亦然。