largest sum contiguous sub array : added method for all -ve no.s

Author: Ram swaroop

src/me/ramswaroop/arrays/LargestSumContiguousSubArray.java

@@ -10,7 +10,7 @@
 public class LargestSumContiguousSubArray {
 
     /**
-     * Based on Kadane's Algorithm. Doesn't work when all 
+     * Based on Kadane's Algorithm. Doesn't work when all
      * elements in array {@param a} are negative.
      *
      * @param a
@@ -31,19 +31,16 @@ public static int getLargestSumOfContiguousSubArray(int[] a) {
     }
 
     /**
-     * TODO
+     * Below algorithm works even when all elements in array {@param a} are negative.
+     *
      * @param a
      * @return
      */
     public static int getLargestSumOfContiguousSubArrayWhenAllNosNegative(int[] a) {
         int maxSum = a[0], maxSumTillIndex = a[0];
 
         for (int i = 1; i < a.length; i++) {
-            if (a[i] > maxSumTillIndex) {
-                maxSumTillIndex = a[i];
-            } else if (maxSumTillIndex + a[i] < maxSumTillIndex) {
-                maxSumTillIndex = a[i];
-            }
+            maxSumTillIndex = Math.max(a[i], maxSumTillIndex + a[i]);
             maxSum = Math.max(maxSum, maxSumTillIndex);
         }