# LeetCode题解——Path Sum

273人阅读 评论(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.

it's easy to use recursion to solve the problem

/**
* 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(!root) return false;
if(!root->left && !root->right) return sum==root->val;
bool flage = false;
if(root->left) flage = hasPathSum(root->left,sum-root->val);
if(flage) return true;
else{
if(root->right) return hasPathSum(root->right,sum-root->val);
else return false;
}
}
};

0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：247427次
• 积分：4148
• 等级：
• 排名：第7689名
• 原创：159篇
• 转载：159篇
• 译文：0篇
• 评论：44条
阅读排行
最新评论