LeetCode 之 Path Sum
2017-11-02 19:33
288 查看
题目链接:Path Sum
给定一个数sum,查看二叉树是否具有从根到叶子节点上路径的值得和等于sum;
需要考虑三种情况:
1、树为空,直接返回false;
2、只有根节点,判断根节点的值是否为sum;
3、存在子树,判断左右子树上是否存在值为sum-root.val的路径。
给定一个数sum,查看二叉树是否具有从根到叶子节点上路径的值得和等于sum;
需要考虑三种情况:
1、树为空,直接返回false;
2、只有根节点,判断根节点的值是否为sum;
3、存在子树,判断左右子树上是否存在值为sum-root.val的路径。
/** * 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) { if(root==null) return false; if(root.left==null&&root.right==null&&root.val==sum) return true; if(hasPathSum(root.left, sum-root.val)||hasPathSum(root.right, sum-root.val)) return true; return false; } }
相关文章推荐
- leetcode64. Minimum Path Sum
- Leetcode 64. Minimum Path Sum
- 【Leetcode】Path Sum
- [LeetCode] 64. Minimum Path Sum 最小路径和
- LeetCode 64. Minimum Path Sum
- LeetCode 112 Path Sum
- [LeetCode] Path Sum
- LeetCode *** 64. Minimum Path Sum
- Leetcode 64. Minimum Path Sum
- LeetCode 64.Minimum Path Sum
- LeetCode: Path Sum
- leetcode 64. Minimum Path Sum
- Leetcode 64. Minimum Path Sum
- LeetCode 112. Path Sum
- LeetCode_Path Sum
- Leetcode 64. Minimum Path Sum
- LeetCode112 Path Sum
- leetcode之 Path Sum
- [Leetcode]-Path Sum
- Leetcode - Path Sum