Leetcode Path Sum

最新推荐文章于 2020-01-02 15:30:00 发布

每天都要有进步

最新推荐文章于 2020-01-02 15:30:00 发布

阅读量141

点赞数

分类专栏： Leetcode Leetcode 重启

本文链接：https://blog.csdn.net/u011472124/article/details/51964173

版权

Leetcode 同时被 2 个专栏收录

262 篇文章 0 订阅

订阅专栏

Leetcode 重启

149 篇文章 0 订阅

订阅专栏

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.

Difficulty: Easy

/**
 * Definition for a binary tree node.
 * 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(sum - root.val == 0 && root.left == null && root.right == null) return true;
        return (hasPathSum(root.left, sum - root.val) || hasPathSum(root.right, sum - root.val));
    }
}