112. Path Sum

原创 2016年08月30日 22:41:17

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.

Subscribe to see which companies asked this question

Show Tags
Show Similar Problems

解题思路:就是通过递归将大问题分拆成很多个小问题,每次递归返回对应值。分别判断左子树和右子树之间的值,再然后进行递归,返回条件是节点为空,或者是终止节点与sum相等。

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public boolean hasPathSum(TreeNode root, int sum) {

        if(root == null){

            return false;
        }

        if(root.left == null && root.right == null){

            if(root.val - sum == 0){

                return true;
            }else{
                return false;
            }
        }

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

    }
}

相关文章推荐

leetcode解题之112 & 113 & 437. Path Sum java版(二叉树路径和)

112. Path Sum ,113. Path Sum II,437. Path Sum III, leetcode解题之112 & 113 & 437. Path Sum java版(二叉树路径和...

Leetcode题 112 和 113. Path Sum I and II

112和113题目是类似的,都是找出等于给定值的路径,不过前者只看有没有,后者是要输出所有符合条件的路径。 112由于只要看有没有等于给定值的路径,所以可以用BFS,将每个树节点的val改为从根节点到...

[LeetCode]112.Path Sum

【题目】 Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that add...

leetcode112 Path Sum

Path Sum Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that...

Leetcode NO.112 Path Sum

本题题目要求如下: Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that a...

LeetCode112.Path Sum题解

1. 题目描述Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that add...
  • lby0910
  • lby0910
  • 2017年03月13日 17:18
  • 113

LeetCode 112 Path Sum(路径和)(BT、DP)(*)

翻译给定一个二叉树root和一个和sum,决定这个树是否存在一条从根到叶子的路径使得沿路所有节点的和等于给定的sum。例如: 给定如下二叉树和sum=22, 5 ...
  • NoMasp
  • NoMasp
  • 2016年01月23日 11:10
  • 2146

LeetCode 112 — Path Sum(C++ Java Python)

题目: 题目翻译: 分析: C++实现: Java实现: Python实现: 感谢阅读,欢迎评论!...

leetCode 112.Path Sum (路径和) 解题思路和方法

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

Leetcode_112_Path Sum

本文是在学习中的总结,欢迎转载但请注明出处:http://blog.csdn.net/pistolove/article/details/41910495 Given a binary tree a...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:112. Path Sum
举报原因:
原因补充:

(最多只允许输入30个字)