leetcode-112-Path Sum

原创 2015年07月09日 21:46:10

                                              Path Sum

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.

是否存在从根节点到叶子节点的和,等于所给的数。


递归 one

/**
 * 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: 
    void solve(TreeNode* root,int sum,bool& f,int s){
        if(!root->left&&!root->right){
            if(s==sum) f=true;
            return;
        }
        if(root->left) solve(root->left,sum,f,s+root->left->val);
        if(root->right) solve(root->right,sum,f,s+root->right->val);
    }
    bool hasPathSum(TreeNode* root, int sum) {
        bool f=false;
        if(!root) return false;// 为空  则返回false
        
        solve(root,sum,f,root->val);
        return f;
    }
};


递归 two

/**
 * 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) {
        return solve(root,sum,0);
    }
    bool solve(TreeNode* root,int sum,int s){
        if(!root) return false;
        if(!root->left&&!root->right)
             return sum==s+root->val;
        
        return solve(root->left,sum,s+root->val)||solve(root->right,sum,s+root->val);//存在即可 故用 || 
    }
};



版权声明:本文为博主原创文章,未经博主允许不得转载。

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
  • 127

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

翻译给定一个二叉树root和一个和sum,决定这个树是否存在一条从根到叶子的路径使得沿路所有节点的和等于给定的sum。例如: 给定如下二叉树和sum=22, 5 ...
  • NoMasp
  • NoMasp
  • 2016年01月23日 11:10
  • 2193

LeetCode 112 — Path Sum(C++ Java Python)

题目: 题目翻译: 分析: C++实现: Java实现: Python实现: 感谢阅读,欢迎评论!...

【LeetCode-面试算法经典-Java实现】【112-Path Sum(路径和)】

【112-Path Sum(路径和)】【LeetCode-面试算法经典-Java实现】【所有题目目录索引】原题  Given a binary tree and a sum, determine if...

leetCode 112.Path Sum (路径和) 解题思路和方法

Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:leetcode-112-Path Sum
举报原因:
原因补充:

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