《代码随想录》二叉树 17.路径总和

代码随想录 https://programmercarl.com/
LeetCode 112. 路径总和 https://leetcode.cn/problems/path-sum/description/

1. 题目描述

2. 题解

class Solution {
    public boolean hasPathSum(TreeNode root, int targetSum) {
        if (root == null)
            return false;

        if (root.left == null && root.right == null) {
            return targetSum == root.val;
        }

        return hasPathSum(root.left, targetSum - root.val) || hasPathSum(root.right, targetSum - root.val);
    }
}