码迷,mamicode.com
首页 > 其他好文 > 详细

112. Path Sum

时间:2019-09-04 09:29:30      阅读:78      评论:0      收藏:0      [点我收藏+]

标签:als   determine   amp   long   span   not   code   color   pat   

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.

Note: A leaf is a node with no children.

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.

class Solution {
    public boolean hasPathSum(TreeNode root, int sum) {
        if(root == null) return false;
        if(root.left == null && root.right == null) return sum == root.val;
        return hasPathSum(root.left, sum - root.val) || hasPathSum(root.right, sum - root.val);
    }
}

差点灵性

112. Path Sum

标签:als   determine   amp   long   span   not   code   color   pat   

原文地址:https://www.cnblogs.com/wentiliangkaihua/p/11456721.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!