[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 MaxSoFar = Integer.MIN_VALUE;
int MaxEndingHere = 0;

for(int i=0; i<nums.length; i++){
if(MaxEndingHere<0)
MaxEndingHere=0;
MaxEndingHere+=nums[i];
MaxSoFar = Math.max(MaxEndingHere,MaxSoFar);
}

return MaxSoFar;
}
}
Dynamic Programming