首页 > 代码库 > leetcode-Path Sum
leetcode-Path Sum
Path Sum
Total Accepted: 31405 Total Submissions: 104326My SubmissionsGiven 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.
Show Tags
Have you met this question in a real interview?
Yes
No
Discuss
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ class Solution { public: int flag=0; bool hasPathSum(TreeNode *root, int sum) { if(root==NULL) return false; pathSum(root,0,sum); if(flag==1) return true; else return false; } int pathSum(TreeNode *root,int res,int sum) { if(root==NULL) return 0; res+=root->val; int l=pathSum(root->left,res,sum); int r=pathSum(root->right,res,sum); if((l+r)==0&&res==sum) { flag=1; } } };
leetcode-Path Sum
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。