【LeetCode】112.Path Sum

李晓磊

于 2015-04-02 18:19:12 发布

阅读量265

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/enjoy_lilei/article/details/44835593

版权

LeetCode 专栏收录该内容

58 篇文章 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 ,

              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.

解答：

依次往下递归，sum值减去当前值，若叶节点值和sum值不同，则为false。

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public boolean hasPathSum(TreeNode root, int sum) {
        if(root == null)
			return false;
		if(root.left == null && root.right == null){
			return sum == root.val;
		}else
			return hasPathSum(root.left,sum-root.val) || hasPathSum(root.right,sum-root.val);
    }
}