leetcode112----Path Sum

最新推荐文章于 2019-09-11 11:50:50 发布

ustcyy91

最新推荐文章于 2019-09-11 11:50:50 发布

阅读量99

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/ustcyy91/article/details/80065700

版权

LeetCode 专栏收录该内容

11 篇文章 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.

解题思路：

递归拆分子问题：

1.root为空返回fasle

2.root是叶子节点且root.val==sum 返回true

3.递归拆分左节点或者右节点满足都返回true

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