75.Path Sum
来源:互联网 发布:js密码加密 编辑:程序博客网 时间:2024/05/22 19:50
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.
备注:本题目写于2015-10-19.当时忘记写博客,今天给补上。
public class Solution {
int flag=0;public boolean hasPathSum(TreeNode root, int sum) {if(root == null ){return false; } else{ if(root.val==sum && root.left==null && root.right == null){ return true; }return hasPathSum(root.left,sum-root.val)||hasPathSum(root.right,sum-root.val); } }}
0 0
- 75.Path Sum
- Path Sum && Path Sum ||
- Path Sum
- Path Sum
- Path Sum
- Path Sum
- Path Sum
- Path Sum
- Path Sum
- Path Sum
- Path Sum
- Path Sum
- Path Sum
- Path Sum
- Path Sum
- Path Sum
- Path Sum
- Path Sum
- Mybatis学习笔记 01
- Leetcode 34 - Search for a Range
- Object-C--->Swift之(七)嵌套函数与闭包
- 开年第一篇
- SurfaceView
- 75.Path Sum
- 11g RAC and DG
- [Swift开发实战]- 类型的扩展
- redis集群
- 使用Dom4j解析XML
- STM32之中断与事件---中断与事件的区别
- uva11292 - The Dragon of Loowater (贪心)
- Python&Numpy:tile函数
- 使用JAXP进行SAX解析(XMLReaderFactory、XMLReader 、SAXParserFactory与SAXParser)