add a solution for 487

Author: fishercoder1534

Diff for: src/main/java/com/fishercoder/solutions/_487.java

@@ -30,4 +30,30 @@ public static int findMaxConsecutiveOnes(int[] nums) {
             return ans;
         }
     }
+
+    public static class Solution2 {
+        /**
+         * This is a more generic solution adapted from https://leetcode.com/problems/max-consecutive-ones-iii/, just set k = 1 here.
+         */
+        public static int findMaxConsecutiveOnes(int[] nums) {
+            int len = nums.length;
+            int left = 0;
+            int right = 0;
+            int ans = 0;
+            int k = 1;
+            for (; right < len; right++) {
+                if (nums[right] == 0) {
+                    k--;
+                }
+                while (k < 0) {
+                    if (nums[left] == 0) {
+                        k++;
+                    }
+                    left++;
+                }
+                ans = Math.max(ans, right - left + 1);
+            }
+            return ans;
+        }
+    }
 }

Diff for: src/test/java/com/fishercoder/_487Test.java

@@ -1,20 +1,22 @@
 package com.fishercoder;
 
 import com.fishercoder.solutions._487;
-import org.junit.BeforeClass;
-import org.junit.Test;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
 
-import static junit.framework.Assert.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertEquals;
 
 public class _487Test {
     private static _487.Solution1 soution1;
+    private static _487.Solution2 soution2;
     private static int[] nums;
     private static int expected;
     private static int actual;
 
-    @BeforeClass
-    public static void setup() {
+    @BeforeEach
+    public void setup() {
         soution1 = new _487.Solution1();
+        soution2 = new _487.Solution2();
     }
 
     @Test
@@ -23,6 +25,8 @@ public void test1() {
         expected = 6;
         actual = soution1.findMaxConsecutiveOnes(nums);
         assertEquals(expected, actual);
+        actual = soution2.findMaxConsecutiveOnes(nums);
+        assertEquals(expected, actual);
 
     }