Path Sum 二叉树路径和 @LeetCode

题目：

给定一个二叉树和一个值sum，求这个二叉树是否存在一条从root到叶子节点的路径以满足路径和和sum相等

思路：

对左右子树分别递归，直到叶子节点，递归过程中更新sum的值

/**
 * Path Sum 
 *
 * 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.
 */
public class S112 {

	public static void main(String[] args) {
		TreeNode n = new TreeNode(5);
		System.out.println(hasPathSum(n, 5));
	}

	// DFS
	public static boolean hasPathSum(TreeNode root, int sum) {
		if(root == null){
	        return false;
	    }
		
		// 节点值匹配且该节点为叶子节点
		if(root.val == sum && root.left==null && root.right==null){
        	return true;
        }
		// 继续在左子树和右子树中搜索
        return hasPathSum(root.left, sum-root.val) || hasPathSum(root.right, sum-root.val);
    }
	
}

/**
 * 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 && sum==root.val){
            return true;
        }
        if(root.left==null && root.right==null && sum!=root.val){
            return false;
        }
        boolean left = hasPathSum(root.left, sum-root.val);
        if(left){
            return true;
        }
        return hasPathSum(root.right, sum-root.val);
    }
}