LeetCode--Path Sum
来源:互联网 发布:painter软件的内存大小 编辑:程序博客网 时间:2024/06/05 20: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.
/** * 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 hasPathSum(root,sum,0); } bool hasPathSum(TreeNode *root, int sum, int now) { if(root == NULL) return false; if(root->left == NULL && root->right == NULL && now+root->val == sum) return true; bool l = hasPathSum(root->left,sum,now+root->val); bool r = hasPathSum(root->right,sum,now+root->val); return l||r; }};
4 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
- Linux产生随机数
- 用mysql实现oracle sequence功能
- Difference between Android Service,Thread,IntentService and AsyncTask
- 链式存储面试题-单链表反转
- 推荐两款好的js弹窗插件
- LeetCode--Path Sum
- NYOJ-115 城市平乱
- window.dialogArguments.location.reload();
- 通过CSS3 Media Query实现响应式Web设计
- ios 8 获取地理位置
- 一些优秀的文章链接地址
- ios6 之后配置 pch文件
- Android TextView投影效果
- 微信摇一摇功能的实现