package com.fishercoder.solutions;

/**
 * 53. Maximum Subarray
 * Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.
 *
 * Example:
 * Input: [-2,1,-3,4,-1,2,1,-5,4],
 * Output: 6
 * Explanation: [4,-1,2,1] has the largest sum = 6.
 *
 * Follow up:
 * If you have figured out the O(n) solution, try coding another solution using the divide and conquer approach, which is more subtle.
 */

public class _53 {

  public static class Solution1 {
    /**credit: https://discuss.leetcode.com/topic/5000/accepted-o-n-solution-in-java*/
    public int maxSubArray(int[] nums) {
      int maxSoFar = nums[0];
      int maxEndingHere = nums[0];
      for (int i = 1; i < nums.length; i++) {
        maxEndingHere = Math.max(nums[i], maxEndingHere + nums[i]);
        maxSoFar = Math.max(maxEndingHere, maxSoFar);
      }
      return maxSoFar;
    }
  }
}

@@ -489,16 +489,18 @@
  _53 %7B%0A%0A
+  
   public
@@ -533,18 +533,22 @@
     
+  
 /**
-credit:
+%0A       *
  htt
@@ -556,16 +556,8 @@
 s://
-discuss.
 leet
@@ -569,18 +569,47 @@
 com/
-topic/5000
+problems/maximum-subarray/discuss/20211
 /acc
@@ -615,17 +615,16 @@
 cepted-o
--
 n-soluti
@@ -633,19 +633,29 @@
 -in-java
+%0A       
 */%0A
+  
     publ
@@ -689,24 +689,26 @@
 ms) %7B%0A      
+  
 int maxSoFar
@@ -715,24 +715,26 @@
  = nums%5B0%5D;%0A
+  
       int ma
@@ -752,24 +752,26 @@
  = nums%5B0%5D;%0A
+  
       for (i
@@ -812,16 +812,18 @@
         
+  
 maxEndin
@@ -882,16 +882,18 @@
         
+  
 maxSoFar
@@ -930,16 +930,18 @@
 SoFar);%0A
+  
       %7D%0A
@@ -946,16 +946,18 @@
 %7D%0A      
+  
 return m
@@ -969,16 +969,20 @@
 ar;%0A    
-%7D%0A
+  %7D%0A  
   %7D%0A%7D%0A

refactor 53