力扣刷题记录 -- JAVA--50---112. 路径总和

@白圭

已于 2024-02-11 21:07:39 修改

阅读量70

点赞数

分类专栏： # 力扣习题记录册__JAVA__代码随想录文章标签： leetcode java 算法

于 2023-08-29 17:11:33 首次发布

本文链接：https://blog.csdn.net/taiyuezyh/article/details/132565949

版权

力扣习题记录册__JAVA__代码随想录专栏收录该内容

151 篇文章 0 订阅

订阅专栏

一、题目

在这里插入图片描述

二、代码

/**
 * 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 
{
    //回溯
    boolean return_bool = false;
    int temp_sum = 0;
    public void cursion(TreeNode root, int targetSum)
    {
        temp_sum = temp_sum + root.val;
        if(temp_sum == targetSum &&root.left==null&&root.right==null) return_bool =true;
        if(return_bool == true) return;

        if(root.left!=null)  
        {
            cursion(root.left,targetSum);
            temp_sum = temp_sum-root.left.val;
        }
        if(root.right!=null)
        {
            cursion(root.right,targetSum);
            temp_sum = temp_sum-root.right.val;           
        }

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

 
       return return_bool;
    }
}

三、运行结果

在这里插入图片描述

四、附录

二刷

/**
 * 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 
{
    //回溯更加合理
    int i;
    boolean res = false;
    int now = 0;
    void find(TreeNode pro, int targetSum)
    {
        if(res == true ) return ;
        now = now+pro.val;
        if( now == targetSum &&pro.left == null && pro.right == null) res = true;
        if(pro.left!=null)
        {
            find(pro.left,targetSum) ;
            now = now-pro.left.val;
        }
        if(pro.right!=null) 
        {
            find(pro.right,targetSum);
            now = now-pro.right.val;
        }
    }
    public boolean hasPathSum(TreeNode root, int targetSum) 
    {

       if(root == null) return false; 
       find(root,targetSum);
       return res;
    }

}