MaximumSubarray.java

package com.learning.leet.strsarrs;

/**
 * Created by sargonbenjamin on 7/10/19.
 * https://leetcode.com/problems/maximum-subarray/
 */
public class MaximumSubarray {


    public static void main(String args[]){
        int[] arr = {-2,1,-3,4,-1,2,1,-5,4};
        MaximumSubarray msm = new MaximumSubarray();
        System.out.println(msm.maxSubArray(arr));
    }

    public int maxSubArray(int[] nums) {

        if(nums==null || nums.length==0)return 0;

        int prev = nums[0];
        int max = prev;
        for(int i = 1; i<nums.length; i++){
            if(prev<0){
                prev = 0;
            }
            prev+=nums[i];
            if(prev>max)max = prev;

        }

        return max;
    }

}