LeetCode 53. Maximum Subarray

public class Solution {
    public int maxSubArray(int[] nums) {
       if (nums == null){
            return 0;
        }
        int currentsum = nums[0];
        int maxsum = nums[0];
        for (int i = 1; i < nums.length; i++){
            if (currentsum >= 0){
                currentsum += nums[i];
            }
            else{
                currentsum = nums[i];
            }
            maxsum = maxsum > currentsum ? maxsum : currentsum;
        }
        return maxsum;
    }
}