public class Solution {
public int maxSubArray(int[] nums) {
int maxSoFar=nums[0], maxEndingHere=nums[0];
for (int i = 1; i < nums.length; ++i){
maxEndingHere = Math.max(maxEndingHere + nums[i], nums[i]);
maxSoFar = Math.max(maxSoFar, maxEndingHere);
}
return maxSoFar;
}
}
Would you love to receive regular updates from me on new stuff I discovered, tested vulnerable and working on? Click here to fill out a form in 5 secs :-).
It is funny how I think.
Many people feel I am too ambitious but I tell them it is just ME.
Don't even bother; If it is not something unique, it won't catch my attention.
Whatever my skills can not achieve, I achieve it with raw talent.
Welcome to my 127.0.0.1.