(Easy) Maximum Subarray LeetCode

class Solution {
    public int maxSubArray(int[] nums) {
    
        // border examinine
        
        if (nums.length ==0 || nums==null){
            return 0;
        }
        
        if(nums.length ==1){
            return nums[0];
        }
        
        
        int[] dp = new int[nums.length];
        
        dp[0]= nums[0];
        dp[1]= Max(nums[1],(nums[1]+dp[0]));
        
        for(int i =2; i< nums.length;i++){
            
            dp[i] = Max(nums[i] , (nums[i]+dp[i-1]));
        }
        
        Arrays.sort(dp);
        
        return dp[nums.length-1];
        
        
    }
    
    public int Max(int a, int b){
        
        return a>b?a:b;
    }
}