From 145a8f35e63931b902919b386bd3d180c30552a9 Mon Sep 17 00:00:00 2001
From: huangge1199 <huangge1199@hotmail.com>
Date: Wed, 1 Sep 2021 16:58:54 +0800
Subject: [PATCH] =?UTF-8?q?1004:=E6=9C=80=E5=A4=A7=E8=BF=9E=E7=BB=AD1?=
 =?UTF-8?q?=E7=9A=84=E4=B8=AA=E6=95=B0=20III?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../editor/cn/MaxConsecutiveOnesIii.java      | 63 +++++++++++++++++++
 .../cn/doc/content/MaxConsecutiveOnesIii.md   | 32 ++++++++++
 2 files changed, 95 insertions(+)
 create mode 100644 src/main/java/leetcode/editor/cn/MaxConsecutiveOnesIii.java
 create mode 100644 src/main/java/leetcode/editor/cn/doc/content/MaxConsecutiveOnesIii.md

diff --git a/src/main/java/leetcode/editor/cn/MaxConsecutiveOnesIii.java b/src/main/java/leetcode/editor/cn/MaxConsecutiveOnesIii.java
new file mode 100644
index 0000000..4a388b2
--- /dev/null
+++ b/src/main/java/leetcode/editor/cn/MaxConsecutiveOnesIii.java
@@ -0,0 +1,63 @@
+//给定一个由若干 0 和 1 组成的数组 A，我们最多可以将 K 个值从 0 变成 1 。 
+//
+// 返回仅包含 1 的最长（连续）子数组的长度。 
+//
+// 
+//
+// 示例 1： 
+//
+// 输入：A = [1,1,1,0,0,0,1,1,1,1,0], K = 2
+//输出：6
+//解释： 
+//[1,1,1,0,0,1,1,1,1,1,1]
+//粗体数字从 0 翻转到 1，最长的子数组长度为 6。 
+//
+// 示例 2： 
+//
+// 输入：A = [0,0,1,1,0,0,1,1,1,0,1,1,0,0,0,1,1,1,1], K = 3
+//输出：10
+//解释：
+//[0,0,1,1,1,1,1,1,1,1,1,1,0,0,0,1,1,1,1]
+//粗体数字从 0 翻转到 1，最长的子数组长度为 10。 
+//
+// 
+//
+// 提示： 
+//
+// 
+// 1 <= A.length <= 20000 
+// 0 <= K <= A.length 
+// A[i] 为 0 或 1 
+// 
+// Related Topics 数组 二分查找 前缀和 滑动窗口 👍 316 👎 0
+
+package leetcode.editor.cn;
+
+//1004:最大连续1的个数 III
+class MaxConsecutiveOnesIii {
+    public static void main(String[] args) {
+        //测试代码
+        Solution solution = new MaxConsecutiveOnesIii().new Solution();
+        solution.longestOnes(new int[]{0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1}, 3);
+    }
+
+    //力扣代码
+    //leetcode submit region begin(Prohibit modification and deletion)
+    class Solution {
+        public int longestOnes(int[] nums, int k) {
+            int index = 0, lsum = 0, rsum = 0;
+            int count = 0;
+            for (int i = 0; i < nums.length; ++i) {
+                rsum += 1 - nums[i];
+                while (lsum < rsum - k) {
+                    lsum += 1 - nums[index];
+                    index++;
+                }
+                count = Math.max(count, i - index + 1);
+            }
+            return count;
+        }
+    }
+//leetcode submit region end(Prohibit modification and deletion)
+
+}
\ No newline at end of file
diff --git a/src/main/java/leetcode/editor/cn/doc/content/MaxConsecutiveOnesIii.md b/src/main/java/leetcode/editor/cn/doc/content/MaxConsecutiveOnesIii.md
new file mode 100644
index 0000000..517c25a
--- /dev/null
+++ b/src/main/java/leetcode/editor/cn/doc/content/MaxConsecutiveOnesIii.md
@@ -0,0 +1,32 @@
+<p>给定一个由若干 <code>0</code> 和 <code>1</code> 组成的数组&nbsp;<code>A</code>，我们最多可以将&nbsp;<code>K</code>&nbsp;个值从 0 变成 1 。</p>
+
+<p>返回仅包含 1 的最长（连续）子数组的长度。</p>
+
+<p>&nbsp;</p>
+
+<p><strong>示例 1：</strong></p>
+
+<pre><strong>输入：</strong>A = [1,1,1,0,0,0,1,1,1,1,0], K = 2
+<strong>输出：</strong>6
+<strong>解释： </strong>
+[1,1,1,0,0,<strong>1</strong>,1,1,1,1,<strong>1</strong>]
+粗体数字从 0 翻转到 1，最长的子数组长度为 6。</pre>
+
+<p><strong>示例 2：</strong></p>
+
+<pre><strong>输入：</strong>A = [0,0,1,1,0,0,1,1,1,0,1,1,0,0,0,1,1,1,1], K = 3
+<strong>输出：</strong>10
+<strong>解释：</strong>
+[0,0,1,1,<strong>1</strong>,<strong>1</strong>,1,1,1,<strong>1</strong>,1,1,0,0,0,1,1,1,1]
+粗体数字从 0 翻转到 1，最长的子数组长度为 10。</pre>
+
+<p>&nbsp;</p>
+
+<p><strong>提示：</strong></p>
+
+<ol>
+	<li><code>1 &lt;= A.length &lt;= 20000</code></li>
+	<li><code>0 &lt;= K &lt;= A.length</code></li>
+	<li><code>A[i]</code> 为&nbsp;<code>0</code>&nbsp;或&nbsp;<code>1</code>&nbsp;</li>
+</ol>
+<div><div>Related Topics</div><div><li>数组</li><li>二分查找</li><li>前缀和</li><li>滑动窗口</li></div></div><br><div><li>👍 316</li><li>👎 0</li></div>
\ No newline at end of file