LeetCode:Path Sum

原创 2015年11月20日 17:31:30

Path Sum

Total Accepted: 78908 Total Submissions: 261199 Difficulty: Easy

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.























code:

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    bool hasPathSum(TreeNode* root, int sum) {
        if(NULL == root) return false;
        if(sum==root->val && NULL == root->left && NULL == root->right) return true;
        return hasPathSum(root->left, sum-root->val) || hasPathSum(root->right, sum-root->val);
    }
};


版权声明:本文为博主原创文章,转载请注明出处。

相关文章推荐

【leetcode】path-sum-ii

huale //2014年8月23日11:16:49 //2014年8月23日11:45:25 //修改上个代码即可,在处理返回值时浪费很长时间 #include #include u...

[leetcode]24 Path Sum II

题目链接:https://leetcode.com/problems/path-sum-ii/ Runtimes:93ms 1、问题 Given a binary tree and a sum,...
  • shawjan
  • shawjan
  • 2015年03月11日 13:45
  • 259

[LeetCode] Binary Tree Maximum Path Sum

Given a binary tree, find the maximum pathsum. The path may start and end at any node inthe tree. ...

Leetcode64 Minimum Path Sum

Minimum Path Sum Given a m x n grid filled with non-negative numbers, find a path from top left to...

Leetcode 437. Path Sum III (Easy) (cpp)

Leetcode 437. Path Sum III (Easy) (cpp)
  • Niko_Ke
  • Niko_Ke
  • 2016年12月26日 02:33
  • 262

Leetcode 124. Binary Tree Maximum Path Sum[hard]

题目: Given a binary tree, find the maximum path sum.For this problem, a path is defined as any seque...

leetcode-124:Binary Tree Maximum Path Sum(Java)

Binary Tree Maximum Path Sum Given a binary tree, find the maximum path sum. The path may st...

leetcode解题之124. Binary Tree Maximum Path Sum Java版 (二叉树的最大路径和)

124. Binary Tree Maximum Path Sum ,leetcode解题之124. Binary Tree Maximum Path Sum Java版 (二叉树的最大路径和)...

path sum iii-leetcode

题目描述(翻译):给你一个二叉树,每个节点存的是整数。再给你个数值作为和,请找出和是这个数值的路径数量。路径没有要求起点或终点必须是根节点或叶子节点,但是它必须是向下的(只能按从父节点到子节点的顺序搜...
  • czl389
  • czl389
  • 2016年11月27日 13:40
  • 571

leetcode[63] Minimum Path Sum 动态规划

Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:LeetCode:Path Sum
举报原因:
原因补充:

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