Arrays->Maximum Subarray [O(N2) Brute Force]
1234567891011121314151617181920212223
class Main {
public static int maxSubArray(int[] nums) {
int max = Integer.MIN_VALUE;
if(nums.length==1){
return nums[0];
}
for(int i=0;i<nums.length-1;i++){
int sum=nums[i];
for (int j = i+1; j<nums.length; j++){
sum+=nums[j];
max = Math.max(sum,max);
}
}
return max;
}
public static void main(String[] args) {
int nums[] = {-2,1,-3,4,-1,2,1,-5,4};
System.out.println(maxSubArray(nums));
}
}
Java
INFO