/*
* 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.
* */
public class Solution {
public static void main(String[] args) {
// TODO Auto-generated method stub
}
public boolean hasPathSum(TreeNode root, int sum) {
if(root == null)
return false;
if(root.left==null&root.right==null&&sum-root.val==0)//要从根到叶子，所以要判断左右节点是否都为空。
return true;
else
return hasPathSum(root.left, sum-root.val)||hasPathSum(root.right, sum-root.val);
}
}
class TreeNode {
int val;
TreeNode left;
TreeNode right;
TreeNode(int x)
{
val = x;
}
}
转载请注明原文地址: https://ju.6miu.com/read-1297596.html
