首页 > 代码库 > [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.
Solution:
1 /** 2 * Definition for binary tree 3 * public class TreeNode { 4 * int val; 5 * TreeNode left; 6 * TreeNode right; 7 * TreeNode(int x) { val = x; } 8 * } 9 */10 public class Solution {11 public boolean hasPathSum(TreeNode root, int sum) {12 return dfs(root,sum,0);13 }14 15 private boolean dfs(TreeNode root, int sum, int curSum) {16 // TODO Auto-generated method stub17 if(root==null)18 return false;19 if(root.left==null&&root.right==null)20 return (curSum+root.val)==sum;21 return dfs(root.left,sum,curSum+root.val)||dfs(root.right, sum, curSum+root.val);22 }23 }
[Leetcode] Path Sum
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。