Java solution, shortest!!!


  • 9
    E
    public boolean hasPathSum(TreeNode root, int sum) {
        if (root == null) {
            return false;
        }
    
        if (sum - root.val == 0 && root.left == null && root.right == null) {
            return true;
        }
    
        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.