[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.

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-root.val的值是否为0，如果为0则存在一条路径的和为sum；如果不为0则递归左子树和右子树。

public boolean hasPathSum(TreeNode root,int sum){
        if(root==null)return false;
        if(root.left==null&&root.right==null){
            if(sum-root.val==0)return true;
        }
        return hasPathSum(root.left,sum-root.val)||hasPathSum(root.right,sum-root.val);
    }