首页 > 代码库 > [leetcode] Path Sum
[leetcode] 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.
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 TreeNode { int val; TreeNode left; TreeNode right; TreeNode(int x) { val = x; } } public boolean hasPathSum(TreeNode root, int sum) { if(root == null) return false; return getPathNum(root,sum); } public boolean getPathNum(TreeNode root, int sum){ if(root.left == null && root.right ==null){ if(sum == root.val) return true; else return false; } boolean ltest = false; boolean rtest = false; if(root.left !=null) ltest = getPathNum(root.left, sum-root.val); if(root.right !=null) rtest = getPathNum(root.right, sum-root.val); return (ltest||rtest); }
[leetcode] Path Sum
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。