【力扣刷题总结之112.路径总和】

相关标签

---

 一、题目要求

 

二、题解和代码实现

1.题解

非官方题解，但容易理解

2.代码实现

代码如下（示例）：

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
        public boolean hasPathSum(TreeNode root, int targetSum) {
        if(root==null){return false;}
        boolean sum = hasSum(root, targetSum-root.val);
        return sum;
    }

    public boolean hasSum(TreeNode root,int targetSum){
         遇到叶子节点，并且计数为0
        if (root.left ==null && root.right ==null && targetSum ==0 ){
            return true;
        }
        // 遇到叶子节点直接返回
        if (root.left == null && root.right ==null){
            return false;
        }

        if (root.left!=null){// 左
            targetSum -= root.left.val; 递归，处理节点;
            boolean leftbool = hasSum(root.left, targetSum);
            if (leftbool){
                return true;
            }
            targetSum +=root.left.val;// 回溯，撤销处理结果
        }

        if (root.right!=null){// 右
            targetSum-=root.right.val; 递归，处理节点;
            boolean rightbool = hasSum(root.right, targetSum);
            if (rightbool){
                return true;
            }
            targetSum +=root.right.val;// 回溯，撤销处理结果
        }
        return false;
    }
}