[LeetCode] Path Sum
2014-01-04 11:20
357 查看
问题:
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
return true, as there exist a root-to-leaf path
is 22.
分析:
一看就是一道递归的题。不难。
代码:
class Solution {
public:
bool hasPathSum(TreeNode *root, int sum) {
if (!root)
return false;
if (!root->left && !root->right && root->val == sum)
return true;
else
return hasPathSum(root->right, sum - root->val) ||
hasPathSum(root->left, sum - root->val);
}
};
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->2which sum
is 22.
分析:
一看就是一道递归的题。不难。
代码:
class Solution {
public:
bool hasPathSum(TreeNode *root, int sum) {
if (!root)
return false;
if (!root->left && !root->right && root->val == sum)
return true;
else
return hasPathSum(root->right, sum - root->val) ||
hasPathSum(root->left, sum - root->val);
}
};
相关文章推荐
- leetcode-64. Minimum Path Sum
- LeetCode 64. Minimum Path Sum
- LeetCode | Path Sum
- leetcode 64. Minimum Path Sum
- [leetcode] Path Sum
- LeetCode *** 112. Path Sum
- LeetCode 64. Minimum Path Sum
- LeetCode 64. Minimum Path Sum
- [leetcode]Path Sum
- leetCode刷题归纳-Dynamic Programming(64. Minimum Path Sum)
- [LeetCode116]Path Sum
- LeetCode 64. Minimum Path Sum
- LeetCode112 Path Sum
- leetcode - 62,63. Unique Paths(II) & 64.Minimum Path Sum
- [leetcode]Path Sum
- LEETCODE: Path Sum
- 【leetcode c++】 112 Path Sum
- LeetCode学习篇二十三——Path Sum
- 【leetcode】64. Minimum Path Sum
- LeetCode 64. Minimum Path Sum