Easy-题目36:112. Path Sum

原创 2016年05月30日 20:27:44

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.
题目大意:
给出一个二叉树和一个和值,判断是否存在一条从根节点到叶节点路径,使得路径上所有值之和等于给定的和值。
题目分析:
(1) 若该节点为空,则不存在;
(2) 若该节点为叶子节点,则判断节点值是否等于当前和值;
(3) 若不是叶子节点,则向左右子树分别递归搜索下去。
源码:(language:c)

bool hasPathSum(struct TreeNode* root, int sum) {
    if(!root)
        return 0;
    else if (!root->left && !root->right)
        return root->val==sum;
    else
        return hasPathSum(root->left,sum-root->val) || hasPathSum(root->right,sum-root->val);
}

成绩:
4ms,beats 73%,众数4ms,27%

版权声明:完整版Leetcode题解请出门左转https://github.com/cmershen1/leetcode/tree/master/docs

相关文章推荐

112. Path Sum [easy] (Python)

题目链接https://leetcode.com/problems/path-sum/题目原文 Given a binary tree and a sum, determine if the tr...

112.Path Sum(Tree-Easy)

Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all...

[Leetcode 112, Easy] Path sum I

[Leetcode 112, Easy] Path sum I

leetcode解题之112 & 113 & 437. Path Sum java版(二叉树路径和)

112. Path Sum ,113. Path Sum II,437. Path Sum III, leetcode解题之112 & 113 & 437. Path Sum java版(二叉树路径和...

Leetcode题 112 和 113. Path Sum I and II

112和113题目是类似的,都是找出等于给定值的路径,不过前者只看有没有,后者是要输出所有符合条件的路径。 112由于只要看有没有等于给定值的路径,所以可以用BFS,将每个树节点的val改为从根节点到...

[LeetCode]112.Path Sum

【题目】 Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that add...

leetcode112 Path Sum

Path Sum Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that...

Leetcode NO.112 Path Sum

本题题目要求如下: Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that a...

LeetCode112.Path Sum题解

1. 题目描述Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that add...
  • lby0910
  • lby0910
  • 2017年03月13日 17:18
  • 115

LeetCode 112 Path Sum(路径和)(BT、DP)(*)

翻译给定一个二叉树root和一个和sum,决定这个树是否存在一条从根到叶子的路径使得沿路所有节点的和等于给定的sum。例如: 给定如下二叉树和sum=22, 5 ...
  • NoMasp
  • NoMasp
  • 2016年01月23日 11:10
  • 2153
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:Easy-题目36:112. Path Sum
举报原因:
原因补充:

(最多只允许输入30个字)