leetcode 第112题 Path Sum
来源:互联网 发布:office 破解版 知乎 编辑:程序博客网 时间:2024/06/04 18:15
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.
思路:采用递归实现,代码比较容易理解。
C++实现:
/** * 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 && root->val == sum) 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 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
- UVa 11561 - Getting Gold
- 安卓学习笔记之四(布局)
- Composer安装Yii2
- configure: error: cannot compute suffix of object files: cannot compile
- PWN STEP2 writeup —— 初试栈溢出
- leetcode 第112题 Path Sum
- RabbitMQ学习之:(一)初识、概念及心得
- TStringList 常用方法与属性
- Spring学习笔记(4)--------IoC学习
- Delphi 函数参数修饰中的var 、out和const
- python的字符串
- Oracle新建用户、角色,授权,建表空间
- hdu 2199 Can you solve this equation?
- ucGUI 12864下的移植