Leetcode 112. Path Sum

package com.gloomy.leetcode;

/**
* 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.
*
* @author 过路的守望
*
*/
public class PathSum {
public boolean hasPathSum(TreeNode root, int sum) {
if (root == null) {
return false;
}
if (sum == root.val && root.left == null && root.right == null) {
return true;
}
/*
* 左右分支
*/
return hasPathSum(root.left, sum - root.val)
|| hasPathSum(root.right, sum - root.val);
}
}