public class SubArrayMaxSum {
public static void main(String[] args) {
int[] a = { -2, -3, 4, -1, -2, 1, 5, -3 };
System.out.println("Maximum contiguous sum is "
+ sum(a));
}
public static int sum(int arr[]){
int sum1=Integer.MIN_VALUE,sum2=0,size=arr.length;
for(int i=0;i<size;i++){
sum2=sum2+arr[i];
if(sum1<sum2){
sum1=sum2;
}
if(sum2<0){
sum2=0;
}
}
return sum1;
}
}
TechInsiderStory is place where you can find basic knowledge of various technology and framework. TechInsiderStory is provide free knowledge on various technology and framework.
SubArray Max Sum
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment