LeetCode 112 Path Sum
程序员文章站
2024-01-05 11:36:34
...
LeetCode 112 Path Sum
===================
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.
需要注意仅有叶子节点开始的,才是符合要求的路径。因为仅当left和right为null时,才判断sum与当前值是否相等;若仅有一个left || right为null,则继续判断不为null的一侧。
public class Solution {
public boolean hasPathSum(TreeNode root, int sum) {
if (root == null) {
return false;
} else {
if (root.left == null && root.right == null) {
if (root.val == sum) return true;
else return false;
} else {
return hasPathSum(root.left, sum - root.val) || hasPathSum(root.right, sum - root.val);
}
}
}
}
转载于:https://www.jianshu.com/p/c17539f5c265
推荐阅读
-
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 Two Sum (java)Longest Substring Without Repeating Characters
-
[LeetCode 4.18] Minimum Path Sum
-
POJ3126 Prime Path(BFS) 类似于Leetcode 单词接龙
-
LeetCode 15: 3Sum题解(python)