LeetCode 112 Path Sum

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

public boolean hasPathSum(TreeNode root, int sum) {
if(root==null)
return false;
if(root.left==null&&root.right==null&&(sum-root.val)==0){
return true;
}
else{
return hasPathSum(root.left, sum-root.val)||hasPathSum(root.right, sum-root.val);
}
}
很简单的一题