使用了递归解决。
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public boolean hasPathSum(TreeNode root, int sum) {}
if(root==null){ //如果根节点为空,则直接返回false
return false;
}
return hasSum(root, sum,root.val);
}
public static boolean hasSum(TreeNode node,int sum,int currentSum){
if(currentSum==sum && node.left==null && node.right==null){ //主要针对根节点
return true;
}
System.out.println(node.val+" "+currentSum);
if(node.left!=null){ //遍历左子树
//System.out.println("leftleft ");
currentSum+=node.left.val;
//System.out.println("current = "+currentSum);
if(currentSum==sum && node.left.left==null && node.left.right==null){
return true;
}else {
if(hasSum(node.left, sum, currentSum)){
return true;
}
}
currentSum-=node.left.val; //失败,还原currentSum
}
if(node.right!=null){ //遍历右子树
// System.out.println("rightrightright ");
currentSum+=node.right.val;
//System.out.println("current = "+currentSum);
if(currentSum==sum && node.right.left==null && node.right.right==null){
return true;
}else {
if( hasSum(node.right, sum, currentSum)){
return true;
}
}
currentSum-=node.right.val;
}
return false;
}
}