Leetcode——112. Path Sum

题目原址

https://leetcode.com/problems/path-sum/description/

题目描述

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.
Note: A leaf is a node with no children.

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的，如果要，返回true，否则返回false

这个题采用的思路是递归，

AC代码

class Solution {
    public boolean hasPathSum(TreeNode root, int sum) {
        //首先判断给定的树是否是空，如果是，则返回false
        if(root == null)
                return false;
        return has(root,sum); 
    }

    public boolean has(TreeNode root, int sum) {
        if(root == null)
            return false;
        //如果当前节点是叶子节点，并且sum的值等于当前节点的值，则返回true
        //否则递归判断其左右子树是否满足，注意每次调用都将sum-当前节点的值。
        if(root.left == null && root.right == null && sum == root.val)
            return true;

        else {
            return has(root.left, sum - root.val) || has(root.right, sum - root.val);
        }
    }
}