LeetCode-Path Sum

最新推荐文章于 2019-05-12 19:33:21 发布

BeHelium

最新推荐文章于 2019-05-12 19:33:21 发布

阅读量143

点赞数

分类专栏： LeetCode 文章标签： LeetCode Java

本文链接：https://blog.csdn.net/qq_24133491/article/details/84790930

版权

LeetCode 专栏收录该内容

306 篇文章 0 订阅

订阅专栏

Description：
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.

题意：计算二叉树中是否存在一条根节点到叶子节点的路径，使得这条路径上的所有节点相加的和为给定的数sum；

解法：要判断二叉树T是否存在这样一条路径，存在到叶子节点的路径节点值和为sum，也就是递归判断是否存在T的子树存在到叶子节点的路径节点值和为sum-T.val；

Java

/**
 * 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) return sum == root.val ? true : false;
        return hasPathSum(root.left, sum - root.val) ||
            hasPathSum(root.right, sum - root.val);
    }
}