112. Path Sum
来源:互联网 发布:java动态绑定 知乎 编辑:程序博客网 时间:2024/06/05 20:31
问题描述:
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.
解题思路:
递归,递减sum,判断root->val是否为sum,有则返回true.
class Solution {
public:
bool hasPathSum(TreeNode* root, int sum) {
if(root==NULL) return NULL;
else if(root->left==NULL&&root->right==NULL&&root->val==sum)
return true;
else {return hasPathSum(root->left,sum-root->val)||hasPathSum(root->right,sum-root->val);}
}
};
阅读全文
0 0
- 112. Path Sum && 113. Path Sum II
- 112. Path Sum&113. Path Sum II
- 112.Path Sum
- LeetCode 112. Path Sum
- [LeetCode]112.Path Sum
- 【LeetCode】112.Path Sum
- [Leetcode] 112. Path Sum
- [leetcode] 112.Path Sum
- 112.Path Sum
- 112. Path Sum
- 112. Path Sum
- 112. Path Sum
- 112. Path Sum
- 112. Path Sum LeetCode
- 112. Path Sum
- 112. Path Sum
- 112. Path Sum
- 112. Path Sum
- ES : 软件工程学的复杂度理论及物理学解释
- 图解集合2:LinkedList
- Ubuntu14.04安装matlab后启动报错
- java基础之对象 规范理解
- Java8 Lambda表达式教程
- 112. Path Sum
- 安装Python-pip时遇到的问题
- MySQL常用命令
- 软件测试术语
- QTcpsocket
- 376. Wiggle Subsequence
- 自学SEO技术?零基础学SEO没你想的那么简单
- Skynet服务器框架(八) 任务和消息调度机制
- iOS-授之以鱼不如授之以渔=_=带你升入理解自定义转场动画