My 3 lines Java solution


  • 0
    N

    public class Solution {

    public boolean hasPathSum(TreeNode root, int sum) {  
        if(root == null) return false;  
        if(root.left == null && root.right == null) return root.val == sum ? true : false;  
        return hasPathSum(root.left , sum - root.val) || hasPathSum(root.right ,sum - root.val);  
          
    }  
    

    }


Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.