refactor 1004

fishercoder1534 · fishercoder1534 · commit a48fd45fcf9a · 2020-06-28T19:26:48.000-07:00
diff --git a/README.md b/README.md
@@ -211,6 +211,7 @@ _If you like this project, please leave me a star._ &#9733;
 |1009|[Complement of Base 10 Integer](https://leetcode.com/problems/complement-of-base-10-integer/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1009.java) | |Easy|
 |1008|[Construct Binary Search Tree from Preorder Traversal](https://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1008.java) | |Medium| Recursion
 |1005|[Maximize Sum Of Array After K Negations](https://leetcode.com/problems/maximize-sum-of-array-after-k-negations/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1005.java) | [:tv:](https://youtu.be/spiwTAuz1_4) |Easy|
+|1004|[Max Consecutive Ones III](https://leetcode.com/problems/max-consecutive-ones-iii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1004.java) |  |Medium| Two Pointers, Sliding Window
 |1003|[Check If Word Is Valid After Substitutions](https://leetcode.com/problems/check-if-word-is-valid-after-substitutions/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1003.java) | |Medium|
 |1002|[Find Common Characters](https://leetcode.com/problems/find-common-characters/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1002.java) |  |Easy|
 |999|[Available Captures for Rook](https://leetcode.com/problems/available-captures-for-rook/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_999.java) | |Easy|
diff --git a/src/main/java/com/fishercoder/solutions/_1004.java b/src/main/java/com/fishercoder/solutions/_1004.java
@@ -0,0 +1,23 @@
+package com.fishercoder.solutions;
+
+public class _1004 {
+    public static class Solution1 {
+        public int longestOnes(int[] A, int k) {
+            int result = 0;
+            int i = 0;
+            for (int j = 0; j < A.length; j++) {
+                if (A[j] == 0) {
+                    k--;
+                }
+                while (k < 0) {
+                    if (A[i] == 0) {
+                        k++;
+                    }
+                    i++;
+                }
+                result = Math.max(result, j - i + 1);
+            }
+            return result;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1004Test.java b/src/test/java/com/fishercoder/_1004Test.java
@@ -0,0 +1,24 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1004;
+import com.fishercoder.solutions._1128;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static junit.framework.TestCase.assertEquals;
+
+public class _1004Test {
+    private static _1004.Solution1 solution1;
+    private static int[] A;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1004.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        A = new int[]{1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0};
+        assertEquals(6, solution1.longestOnes(A, 2));
+    }
+}
