class Solution {
int total = 0;
public int pathSum(TreeNode root, int sum){
if(root == null) return 0;
return pathSumFrom(root, sum) + pathSum(root.left, sum) + pathSum(root.right, sum);
}
private int pathSumFrom(TreeNode node, int sum){
if(node == null) return 0;
int num = 0;
if(node.val == sum) num++;
return num + pathSumFrom(node.left, sum-node.val) + pathSumFrom(node.right, sum - node.val);
}
}
*/
//preSum map: faster solution
class Solution {
public int pathSum(TreeNode root, int sum){
Map<Integer, Integer> preSum = new HashMap<Integer, Integer>();
preSum.put(0, 1);
return helper(root, sum, 0, preSum);
}
private int helper( TreeNode node, int target, int curSum, Map<Integer, Integer> preSum ){
if(node == null) return 0;
curSum += node.val;
int count = preSum.getOrDefault( curSum - target, 0 );
preSum.put(curSum, preSum.getOrDefault(curSum, 0) + 1);
count += helper(node.left, target, curSum, preSum) + helper(node.right, target, curSum, preSum);
preSum.put(curSum, preSum.getOrDefault(curSum, 0) -1);
return count;
}
}
437 path sum III
最后编辑于 :
©著作权归作者所有,转载或内容合作请联系作者
- 文/潘晓璐 我一进店门,熙熙楼的掌柜王于贵愁眉苦脸地迎上来,“玉大人,你说我怎么就摊上这事。” “怎么了?”我有些...
- 文/花漫 我一把揭开白布。 她就那样静静地躺着,像睡着了一般。 火红的嫁衣衬着肌肤如雪。 梳的纹丝不乱的头发上,一...
- 文/苍兰香墨 我猛地睁开眼,长吁一口气:“原来是场噩梦啊……” “哼!你这毒妇竟也来了?” 一声冷哼从身侧响起,我...
推荐阅读更多精彩内容
- 题目 You are given a binary tree in which each node contain...
- Easy You are given a binary tree in which each node conta...