首页 > 代码库 > Path Sum
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.
/** * Definition for binary tree * 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) { bool flag = false; level(root,0,sum,flag); return flag; } void level(TreeNode *node, int tmpsum, int sum, bool& flag) { if(flag) return; if(node == NULL) return; int newsum = tmpsum + node->val; if(newsum == sum && node->left == NULL && node->right == NULL){ flag = true; return; } else{ level(node->left, newsum, sum, flag); level(node->right, newsum, sum, flag); } }};
Path Sum
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。