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.

思路：每次收集这一层的sum，然后继续，直到leaf节点了，返回判断；然后搜索两边。

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public boolean hasPathSum(TreeNode root, int targetSum) {
        return hasPathSumHelper(root, targetSum, 0);
    }
    
    private boolean hasPathSumHelper(TreeNode root, int targetSum, int cursum) {
        if(root == null) {
            return false;
        }
        if(root.left == null && root.right == null) {
            if(cursum + root.val == targetSum) {
                return true;
            }
            return false;
        }
        return hasPathSumHelper(root.left, targetSum, cursum + root.val)
            || hasPathSumHelper(root.right, targetSum, cursum + root.val);
    }
}