Leetcode 53: Maximum Subarray

Find the contiguous subarray within an array (containing at least one number) which has the largest sum.

For example, given the array [-2,1,-3,4,-1,2,1,-5,4],
the contiguous subarray [4,-1,2,1] has the largest sum = 6.

 

public class Solution {
    public int MaxSubArray(int[] nums) {
        int curSum = 0, result = Int32.MinValue;
        
        int j = 0;
        while (j < nums.Length)
        {
            curSum += nums[j];
            result = Math.Max(result, curSum);
            if (curSum < 0)
            {
                curSum = 0;
            }
            
            j++;
        }
        
        return result;
    }
}