Create Solution.java

Author: Jerring

solution/1004. Max Consecutive Ones III/Solution.java

@@ -0,0 +1,10 @@
+class Solution {
+    public int longestOnes(int[] A, int K) {
+        int l = 0, r = 0;
+        while (r < A.length) {
+            if (A[r++] == 0) --K;
+            if (K < 0 && A[l++] == 0) ++K;
+        }
+        return r - l;
+    }
+}