Problem
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.
My Solution
class Solution {
public int maxSubArray(int[] nums) {
int max = Integer.MIN_VALUE, sum =0;
for (int i = 0; i < nums.length; ++i) {
sum = 0;
for (int j = i; j < nums.length; ++j) {
if (sum < 0) {
break;
} else {
sum += nums[j];
}
if (sum > max) {
max = sum;
}
}
}
return max;
}
}
Great Solution
public int maxSubArray(int[] nums) {
int max = Integer.MIN_VALUE, sum = 0;
for (int i = 0; i < nums.length; i++) {
if (sum < 0)
sum = nums[i];
else
sum += nums[i];
if (sum > max)
max = sum;
}
return max;
}
