LeetCode 112:Path Sum
来源:互联网 发布:自制手机铃声软件 编辑:程序博客网 时间:2024/05/18 04:57
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.
//利用深度优先搜索DFS,当搜索到的节点为叶子节点时,才判断总和是否等于给定的sum值class Solution {public:bool dfs(TreeNode* node, int sum, int curSum){if (node == NULL)return false;if (node->left == NULL && node->right == NULL)return curSum + node->val == sum;return dfs(node->left, sum, curSum + node->val) || dfs(node->right, sum, curSum + node->val);}bool hasPathSum(TreeNode* root, int sum) {return dfs(root, sum, 0);}};
2 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
- WinPcap Pcap_findalldevs_ex() pcap_if
- 解析:TypedArray 为什么需要调用recycle()
- ios runtime 动态注册一个新类 增加一个方法
- Android使用系统打电话
- 装载问题
- LeetCode 112:Path Sum
- iOS开发之设计模式(一)
- PHP Socket请求类
- 【Linux 驱动】Netfilter/iptables (六) 内核协议栈编程(发送skb)
- Junit 入门(一)
- 算法
- 《RocketMq》四、Producer生产者
- css3效果
- (NO.00005)iOS实现炸弹人游戏(二):素材选择的取舍