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 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.
题目链接:112. Path Sum
算法描述:
由题意知,给定一个二叉树和一个值 sum,判断这棵二叉树中是否存在一条从根到叶节点的路径,这条路径的权值之和为给定的值 sum。
我们用迭代来做这道题,如果树为空,那么返回 false;如果根(节点)的值为 sum,并且没有左右子树,那么返回 true;否则迭代函数,第一项参数修改为节点的左右子树(只要左右子树任意一棵满足即可),第二项参数修改为 sum 减去该节点的权值。
代码:
/**
* 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==NULL){
return false;
}
else if(root->val==sum && root->left==NULL && root->right==NULL){
return true;
}
else{
return hasPathSum(root->left, sum-root->val) ||hasPathSum(root->right, sum-root->val);
}
}
};