The largest and most contiguous sub-arrays

Tag: sts Val gets value Max bar for return null

The largest of the public class continuous sub-arrays
{
Time Complexity of O (n)
private static int getsubmaxsum (int[] array)
{
if (array = = NULL | | array.length = = 0)
{
return 0;
}
int sum = 0;
int maxsum = Integer.min_value;
for (int i = 0; i < array.length; i++)
{

When sum<=0, reset sum=0
if (sum <= 0)
{
sum = Array[i];
}
Else
{
Sum + = Array[i];
}
if (Sum > Maxsum)
{
Maxsum = sum;
}
}
return maxsum;
}
Using dynamic planning to implement
public int FindGreatestSumOfSubArray2 (int[] arr,int N) {
int sum = arr[0];
int max = arr[0];
for (int i = 1; i < n; i++) {
sum = Getmax (Sum+arr[i],arr[i]);
if (sum >= max)
max = sum;
}

return Max;
}

public int Getmax (int a,int b) {
Return a > B? A:B;
}
}

The largest and most contiguous sub-arrays