Arrays->Maximum Sub Array(Kadanes algo O(N)]
123456789101112131415
class Main {
public static int maxSubArray(int[] nums) {
int currentSum = nums[0];
int maxSum = currentSum;
for(int i=1;i<nums.length;i++){
currentSum = Math.max(currentSum + nums[i], nums[i]);
maxSum = Math.max(currentSum, maxSum);
}
return maxSum;
}
public static void main(String[] args) {
int nums[] = {-2,1,-3,4,-1,2,1,-5,4};
System.out.println(maxSubArray(nums));
}
}
Java
INFO