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 the values along the path equals the given sum.
Note: A leaf is a node with no children.
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.
112. Path Sum
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
//本题目注意:题目说的是根结点到顶点 测试用例有负数
class Solution {
public boolean hasPathSum(TreeNode root, int sum)
{
boolean ans=false;
if(root==null)return false;
if(root.val==sum&&root.left==null&&root.right==null)return true;//题目说的是根结点到顶点
//if(root.val>sum)return false;//仅对根结点有效 测试用例有负数
//if(root.val<sum)sum=sum-root.val;// 测试用例有负数
sum=sum-root.val;
if(root.left!=null/*&&root.left.val<=sum*/)
{
ans=hasPathSum(root.left,sum);
}
if(ans==true)return true;
if(root.right!=null/*&&root.right.val<=sum*/)
{
ans=hasPathSum(root.right,sum);
}
return ans;
}
}
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 the values along the path equals the given sum.
Note: A leaf is a node with no children.
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.