[leetcode-112]Path Sum(java)
来源:互联网 发布:数据采集卡原理图 编辑:程序博客网 时间:2024/05/13 13:23
问题描述:
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.
分析:这道题要注意,路径中可能存在正数和负数,所以不能剪枝。此外,递归到什么程度,应该递归到叶节点。当然如果遇到null时,直接返回false即可。为啥要递归到叶节点而不是null呢?因为递归到null不能说明进行到了叶节点,此时不能拿sum 和 now的大小说事。
代码如下:364ms
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */public class Solution { private boolean checkPathSum(TreeNode root,int sum,int now){ if(root==null) return false; now += root.val; //leaf node if(root.left==null && root.right==null){ return sum==now; } return checkPathSum(root.left,sum,now) || checkPathSum(root.right,sum,now); } public boolean hasPathSum(TreeNode root, int sum) { if(root==null) return false; return checkPathSum(root,sum,0); }}
0 0
- [leetcode-112]Path Sum(java)
- [Java]LeetCode 112Path Sum&113Path Sum II
- [Leetcode] Path Sum (Java)
- [leetcode]Path Sum[java]
- [LeetCode][Java] Path Sum
- LeetCode|Path Sum-java
- leetcode:Path Sum 【Java】
- 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
- 使用重写的$.ajax()实现后台处理进度显示(gif)
- android app记录运行日志 捕获奔溃异常 ,存储日志到文件
- Spark将HDFS数据导入到HBase
- Git教程2——基础
- 反应堆模式的用法
- [leetcode-112]Path Sum(java)
- UVa 3266 Tian Ji -- The Horse Racing
- HTML DOM top属性
- 23-IO流-43-IO流(Properties集合的-list方法)
- Constructing Roads HDU杭电1102【Kruscal || Prim】
- bex5中的常用方法总结
- 继续畅通工程
- js模拟Map
- libevent 安装与使用说明