力扣112. 路径总和

112. 路径总和 - 力扣（LeetCode） (leetcode-cn.com)

class Solution {
    boolean res;
    public boolean hasPathSum(TreeNode root, int targetSum) {
        if(root==null)return false;
        rootsum(root,targetSum);
        return res;
    }
    public void rootsum(TreeNode root, int targetSum){
        if(root==null)return;
        if(root.val==targetSum&&(root.right==null&&root.left==null))res = true;
        rootsum(root.left,targetSum-root.val);
        rootsum(root.right,targetSum-root.val);
    }
}

标签：val,rootsum,res,力扣,targetSum,112,null,root,总和
来源： https://blog.csdn.net/qq_40665593/article/details/120529042