[leetcode]112. Path Sum@Java解题报告

路径总和问题解析

最新推荐文章于 2024-09-08 00:15:00 发布

原创最新推荐文章于 2024-09-08 00:15:00 发布 · 522 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#Path Sum #leetcode

leetcode 专栏收录该内容

130 篇文章

订阅专栏

本文探讨了LeetCode中路径总和问题的解决方法，通过递归算法检查二叉树是否存在从根节点到叶子节点的路径使得所有节点值的和等于给定的值。示例中给出了一棵树和目标和22的情况，展示了算法如何返回正确的布尔值。

https://leetcode.com/problems/path-sum/description/

Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.

For example:
Given the below binary tree and

sum
 = 22

              5
             / \
            4   8
           /   / \
          11  13  4
         /  \      \
        7    2      1

return true, as there exist a root-to-leaf path 5->4->11->2 which sum is 22.

package go.jacob.day808;

public class Demo1 {
	/*
	 * 递归求解
	 */
	public boolean hasPathSum(TreeNode root, int sum) {
		if (root == null)
			return false;
		if (sum == root.val && root.left == null && root.right == null)
			return true;

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