1ms simple Java solution


  • 0
    P
    public class Solution {
        public boolean hasPathSum(TreeNode root, int sum) {
            if(root==null)return false;
            if(root.left==null&&root.right==null&&root.val==sum)return true;
            else if(root.left==null&&root.right==null&&root.val!=sum)return false;
            return hasPathSum(root.left,sum-root.val)||hasPathSum(root.right,sum-root.val);
        }
    }

  • 3
    T
    public class Solution {
    public boolean hasPathSum(TreeNode root, int sum) {
        if(root==null){
            return false;
        }
        if((root.left==null)&&(root.right==null)){
            return sum==root.val;
        }
        return hasPathSum(root.right, sum-root.val)||hasPathSum(root.left, sum-root.val);
    }
    

    }


Log in to reply
 

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