题解 | #二叉树中和为某一值的路径(一)#
二叉树中和为某一值的路径(一)
https://www.nowcoder.com/practice/508378c0823c423baa723ce448cbfd0c
function hasPathSum( root, sum ){
if( root == null ){
return false;
}
if( root.left == null && root.right == null ){
return sum == root.val;
}
return hasPathSum( root.left, sum - root.val ) || hasPathSum( root.right, sum - root.val );
}
