Given a list of numbers, find the contiguous sublist that has the largest sum.

SumLargestSubset.java

public int getSumLargestSubset(int[] array){
    int sumSoFar = 0;
    int largestSum = 0;
    for (int i=0; i < array.length; i++){
        sumSoFar = sumSoFar + array[i];
        if (sumSoFar < 0){
            sumSoFar = 0;
        }
        else if (sumSoFar > largestSum){
            largestSum = sumSoFar;
        }
    }
    return largestSum;
}