二叉树路径总和

题目描述

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.
Note: A leaf is a node with no children.
Example:
Given the below binary tree and sum = 22,

return true, as there exist a root-to-leaf path 5->4->11->2 which sum is 22.

/**
 * 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) {
       boolean lans,rans;
        if(root==null){
            return false;
        }else if(root.val==sum && root.left==null && root.right==null){//在递归里，直接得到最终目标或者永远不能得到最终目标的先做判断（即，寻找退出条件）
            return true;
        }else{
            lans = (root.left!=null)?hasPathSum(root.left , sum-root.val):false;
            rans = (root.right!=null)?hasPathSum(root.right , sum-root.val):false;
            //不能return (root.left!=null)?hasPathSum(root.left , sum-root.val):false||(root.right!=null)?hasPathSum(root.right , sum-root.val):false;
            return lans||rans;
           //左右两条路径有至少一条走通即可，两边要同时判断(放在一句里，同时执行)
        }
    }
}