refactor 53

fishercoder1534 · fishercoder1534 · commit 90e75ad45a7a · 2020-04-03T07:51:05.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_53.java b/src/main/java/com/fishercoder/solutions/_53.java
@@ -15,16 +15,18 @@
 
 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);
+    public static class Solution1 {
+      /**
+       * https://leetcode.com/problems/maximum-subarray/discuss/20211/accepted-on-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;
       }
-      return maxSoFar;
     }
-  }
 }
