LeetCode Path Sum
2014-10-20 22:25
218 查看
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
return true, as there exist a root-to-leaf path
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->2which sum is 22.
/** * Definition for binary tree * 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.val==sum && root.left==null && root.right==null) { return true; } return hasPathSum(root.left, sum-root.val) || hasPathSum(root.right, sum-root.val); } }
相关文章推荐
- Leetcode 112 Path Sum
- LeetCode *** 64. Minimum Path Sum
- LeetCode 64. Minimum Path Sum
- [LeetCode] Path Sum
- LeetCode 112. Path Sum
- leetcode 64. Minimum Path Sum
- Leetcode 112. Path Sum (Easy) (cpp)
- Leetcode: Path Sum
- LeetCode 112 Path Sum
- [Leetcode 11] 112 Path Sum
- Leetcode - Path Sum
- Leetcode: 112. Path Sum(JAVA)
- leetcode - 112. Path Sum
- DP问题—Leetcode 64. Minimum Path Sum
- leetcode[112]:Path Sum
- [leetcode] 64.Minimum Path Sum
- LeetCode - 112. Path Sum
- leetcode 64. Minimum Path Sum
- Path Sum - LeetCode
- [leetcode] 64. Minimum Path Sum