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.

思路：Using recursion to compare the current value and sum.

易错点：   {1,2}, 1 应该返回true . 所以在添加时候应该判断 root.left == null && root.right == null

/**
 * 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) {
        return hasSum(root, 0, sum);
    }
    
    private boolean hasSum(TreeNode root, int cur, int sum){
        if(root == null)
            return false;
        cur += root.val;
        if(root.left == null && root.right == null && cur == sum){
            return true;
        }
        return hasSum(root.left, cur, sum) || hasSum(root.right, cur, sum);
    }
}