[leetcode]Path Sum
2014-07-31 20:27
197 查看
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
return true, as there exist a root-to-leaf path
算法思路：
dfs
代码如下：
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->2which sum is 22.
算法思路：
dfs
代码如下：
public class Solution {
public boolean hasPathSum(TreeNode root, int sum) {
if(root == null) return false;
if(root.left == null && root.right == null && root.val == sum) return true;
if(root.left != null && hasPathSum(root.left, sum - root.val)) return true;
if(root.right != null && hasPathSum(root.right, sum - root.val)) return true;
return false;
}
}
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- Leetcode:Path Sum
- leetcode 112 —— Path Sum
- LeetCode 64. Minimum Path Sum
- Leetcode Path Sum
- [LeetCode] Path Sum
- leetcode_64. Minimum Path Sum
- Leetcode: Path Sum
- Leetcode 112 Path Sum
- [Leetcode 11] 112 Path Sum
- leetcode-112-Path Sum
- 【一天一道LeetCode】#112. Path Sum
- leetcode-64. Minimum Path Sum
- LeetCode 64. Minimum Path Sum
- leetcode——112——Path Sum
- LeetCode（112） Path Sum
- [leetcode] 64.Minimum Path Sum
- LeetCode112—Path Sum
- LeetCode 112. Path Sum（路径和）
- Path Sum - LeetCode
- LeetCode 64. Minimum Path Sum