LeetCode Path Sum
来源:互联网 发布:linux常用命令删除目录 编辑:程序博客网 时间:2024/06/05 06:47
题目:
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.
/** * Definition for binary tree * 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) { return dfs(root, 0, sum); }private: bool dfs(TreeNode *root, int cur, int sum) { if(root == NULL) return false; cur += root->val; //到叶节点时再判断 if(root->left == NULL && root->right == NULL && cur == sum) return true;return dfs(root->left, cur, sum) || dfs(root->right, cur, sum); }};
0 0
- leetcode Path Sum && Path Sum ||
- 【Leetcode】Path Sum (Sum)
- leetcode:leetcode :Path Sum
- 【Leetcode】Path Sum II (Sum)
- LeetCode: Minimum Path Sum
- LeetCode: Path Sum
- LeetCode: Path Sum II
- LeetCode Minimum Path Sum
- LeetCode Path Sum
- LeetCode Path Sum II
- [Leetcode] Path Sum
- [Leetcode] Path Sum II
- LeetCode : Minimum Path Sum
- [Leetcode] Minimum Path Sum
- LeetCode: Path Sum
- LeetCode: Path Sum II
- [LeetCode] Path Sum
- [LeetCode] Path Sum II
- chapter2
- UpdatePanel与Jquery冲突的解决方法
- ZOJ3707 Calculate Prime S 数论好题目啊
- 适配器模式(Adapter)
- ------------------------------利用BroadcastReceiver进行Activity和Service之间的通信(留着自己参考用)
- LeetCode Path Sum
- 冒泡排序算法的java实现
- cocos2d-x3.0rc移植Android,程序异常退出,运行错误cannot find native library cocos2dcpp
- 网络爬虫基本原理(一)
- hdu2435最大流最小割
- HDU 1196 Lowest Bit
- 网络爬虫基本原理(二)
- Camshift跟踪(下)
- LINK : fatal error LNK1123: 转换到 COFF 期间失败: 文件无效或损坏