LeetCode 112: Path Sum
来源:互联网 发布:node nexttick 编辑:程序博客网 时间:2024/05/24 02:12
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
,
return true, as there exist a root-to-leaf path 5->4->11->2
which sum is 22
.
解题思路
代码如下:
/** * 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; if (root->left == NULL && root->right == NULL); 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
- hdu1422(简单dp)
- hdoj 2531 Catch him(块状元素)(好题)
- 深入理解java异常处理机制
- iOS学习笔记37-iOS9适配 之 关于info.plist 第三方登录 添加URL Schemes白名单
- 读书计划清单
- LeetCode 112: Path Sum
- Xcode清楚缓存、清理多余证书
- Android --DOM SAX XML 的解析
- 游戏中为什么使用脚本游戏为什么会有脚本这个东西
- Android Volley完全解析(一),初识Volley的基本用法
- Vmware虚拟机下三种网络模式配置
- 辗转相除法(欧几里得算法)
- eclipse4 以后,RCP 界面开发configurer.setShellStyle(SWT.MIN | SWT.CLOSE);不生效的解决方法
- 学习windows驱动(缓冲区溢出)