题目:
给你二叉树的根节点 root 和一个表示目标和的整数Sum ,判断该树中是否存在 根节点到叶子节点 的路径,这条路径上所有节点值相加等于目标和Sum 。
判断给定的sum值,是否为一条完整路径的和。
解:
/**
* 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) {
if(root == null){
return false;
}
if(root.left == null && root.right == null){
return targetSum - root.val == 0;
}
return hasPathSum(root.left,targetSum - root.val) || hasPathSum(root.right,targetSum - root.val);
}
}