leetCode #112 path sum
2015-03-08 17:22
375 查看
题目：在二叉树里找到一条从叶子到根的通路，使其各结点和为指定的数。
分析：dfs深搜的简单题目。感觉好神奇啊。
答案：
class Solution {
public:
bool hasPathSum(TreeNode *root, int sum) {
return dfs(root, sum, 0);
}
private:
bool dfs(TreeNode *node, int sum, int currentSum)
{
if (node == NULL)
return false;
if (node->left == NULL && node->right == NULL)// is leaf node
return ((currentSum + node->val) == sum);
return(dfs(node->left, sum, currentSum + node->val) || dfs(node->right, sum, currentSum + node->val) );
}
};
分析：dfs深搜的简单题目。感觉好神奇啊。
答案：
class Solution {
public:
bool hasPathSum(TreeNode *root, int sum) {
return dfs(root, sum, 0);
}
private:
bool dfs(TreeNode *node, int sum, int currentSum)
{
if (node == NULL)
return false;
if (node->left == NULL && node->right == NULL)// is leaf node
return ((currentSum + node->val) == sum);
return(dfs(node->left, sum, currentSum + node->val) || dfs(node->right, sum, currentSum + node->val) );
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- LeetCode 112 Path Sum
- 【leetcode c++】 112 Path Sum
- LeetCode112 Path Sum
- Leetcode-112 Path Sum
- Leetcode 112 path sum & 113 path sum 2
- Leetcode 笔记 112 - Path Sum
- LeetCode 112 Path Sum
- LeetCode112——Path Sum
- Leetcode 112 Path Sum
- [LeetCode]112 Path Sum
- Leetcode 112 Path Sum
- leetcode[112]:Path Sum
- LeetCode（112） Path Sum
- Leetcode 112 Path Sum
- LeetCode_112 Path Sum
- [LeetCode]题解（python）：112-Path Sum
- [LeetCode 112] Path Sum
- leetcode——112——Path Sum
- LeetCode（112） Path Sum
- leetcode 112 Path Sum