jean - 1 year ago 89

Java Question

Find the maximum sum possible by adding numbers in array together. You can add as many numbers as you like, but you can't skip over numbers.

`{1, 2, 3, -4, 3} max sum is 6 (1 2 and 3)`

{1, 2, 3, -4, 3, 2, -3, 2} max sum is 7 (1 2 3 -4 3 and 2)

{1, 2, 4} max sum is 7

{-4, -3, -10, -12} max sum is -3

You can assume the smallest value will be -10000

`public int maximumSum( int[] a ) {`

return max;

}

Recommended for you: Get network issues from **WhatsUp Gold**. **Not end users.**

Answer Source

Probably something along these lines;

```
public int getMaxSum(int[] numbers)
{
//this stores the highest sum we have found so far
//Integer.MIN_VALUE is the smallest possible value,
//but your assignment would work with maxSum = -10000;
int maxSum = Integer.MIN_VALUE;
//starting at the 1st number in the list, then the 2nd, etc
for (int pos = 0; pos < numbers.length; pos++)
{
//will temporarily hold the sum of numbers from "pos" onwards
int val = 0;
//take the number at "pos + 0", then "pos + 1", etc
for (n = 0; n< numbers.length - pos; n++)
{
//add the next number to the current tally
val += numbers[pos + n];
//if it is bigger, then we have a new highest sum
if (val > maxSum) maxSum = val;
}
}
//now maxSum should hold the highest sum
return maxSum;
}
```

Recommended from our users: **Dynamic Network Monitoring from WhatsUp Gold from IPSwitch**. ** Free Download**