LeetCode (Path Sum)
来源:互联网 发布:淘宝产品市场调查表 编辑:程序博客网 时间:2024/06/07 18:50
Problem:
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 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) return false; if(!root->right && !root->left) return root->val == sum; int tmp = sum - root->val; return hasPathSum(root->right, tmp) || hasPathSum(root->left, tmp); }};
阅读全文
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
- 交换链表中两个节点
- 服务器Servlet数据传到jsp页面
- 51Nod 1201 整数划分
- datatables 多条件搜索
- Thymeleaf系列三 调用对象的成员变量值、Map值、List值、属性的方法 、ctx对象、param、session和application
- LeetCode (Path Sum)
- Flex 阻止列表类型组件改变所选项
- 项目案例:新闻发布系统
- dynamic-linker
- 开发人员学Linux(7):CentOS7编译安装PHP并配置PHP-FPM
- UI设计的20个原则
- Python快速入门-前言
- 云计算的核心技术有哪些?
- 2017JetBrains激活 含pycharm