112. Path Sum

时间：2019-03-15 16:19:49 阅读：138 评论：0 收藏：0 [点我收藏+]

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,

return true, as there exist a root-to-leaf path 5->4->11->2 which sum is 22.

//一路减下去直到减为0

class Solution {

public boolean hasPathSum(TreeNode root, int sum) {

if (root == null) return false;

if (root.left == null && root.right == null && sum - root.val == 0) return true;

return hasPathSum(root.left, sum - root.val) || hasPathSum(root.right, sum - root.val);

}

原文：https://www.cnblogs.com/MarkLeeBYR/p/10537423.html

踩

(0)

评论一句话评论（0）

分享档案

更多>