[Leetcode] #112 Path Sum
来源:互联网 发布:中国网瘾少年数据 编辑:程序博客网 时间:2024/05/18 06:34
Discription:
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.
Solution:
bool hasPathSum(TreeNode* root, int sum) {if (root == NULL) return false;if (root->val == sum && root->left == NULL && root->right == NULL) return true;return hasPathSum(root->left, sum - root->val) || hasPathSum(root->right, sum - root->val);}
0 0
- LeetCode(112)Path Sum
- LeetCode 112 Path Sum
- LeetCode: Path Sum [112]
- 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[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 112:Path Sum
- 自定义UIPageControl
- Android绘图篇-01 Canvas和Paint的基础使用
- java生成和解析二维码实战——QRCode
- 有关onPreviewFrame未被调用的问题
- pybrain学习教程(二):创建数据集
- [Leetcode] #112 Path Sum
- React(一):React的设计哲学 - 简单之美
- 第四节 html段落样式
- SSHD服务安装、配置、使用
- Hub,bridge,switch and router的区别
- P2831 愤怒的小鸟
- angularjs的循环遍历
- 使用 PyInstaller 把python程序 .py转为 .exe 可执行程序
- Python学习--15 日期和时间