longest-subarray-of-1s-after-deleting-one-element

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

cangjie

bash

mysql

mssql

postgresql

oraclesql

pythondata

Maintain a sliding window where there is at most one zero in it.

Algorithms

You are given a binary array <code>nums</code>, you should delete one element from it.

Return the size of the longest non-empty subarray containing only 1&#39;s in the resulting array. Return 0 if there is no such subarray.

&nbsp;
Example 1:

<pre>
Input: nums = [1,1,0,1]
Output: 3
Explanation: After deleting the number in position 2, [1,1,1] contains 3 numbers with value of 1&#39;s.
</pre>

Example 2:

<pre>
Input: nums = [0,1,1,1,0,1,1,0,1]
Output: 5
Explanation: After deleting the number in position 4, [0,1,1,1,1,1,0,1] longest subarray with value of 1&#39;s is [1,1,1,1,1].
</pre>

Example 3:

<pre>
Input: nums = [1,1,1]
Output: 2
Explanation: You must delete one element.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums.length &lt;= 105</code></li>
	<li><code>nums[i]</code> is either 0 or 1.</li>
</ul>

第 29 场双周赛

biweekly-contest-29

longestSubarray

资深工程师

Longest Subarray of 1's After Deleting One Element

Max Consecutive Ones III

max-consecutive-ones-iii

最大连续1的个数 III

Array

Dynamic Programming

Sliding Window

给你一个二进制数组 <code>nums</code>，你需要从中删除一个元素。

请你返回删除操作后，数组中仅包含 1 的&nbsp;最长非空子数组&nbsp;的长度。如果不存在这样的&nbsp;子数组，请返回 0。

&nbsp;

示例 1：

<pre>
输入：nums = [1,1,0,1]
输出：3
解释：删除下标为 2 的元素后，得到 [1,1,1]，其中包含 3 个值为 1 的元素。
</pre>

示例 2：

<pre>
输入：nums = [0,1,1,1,0,1,1,0,1]
输出：5
解释：删除下标为 4 的元素后，得到 [0,1,1,1,1,1,0,1]，其中仅包含 1 的最长子数组为 [1,1,1,1,1]。
</pre>

示例 3：

<pre>
输入：nums = [1,1,1]
输出：2
解释：你必须删除一个元素。
</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= nums.length &lt;= 105</code></li>
	<li><code>nums[i]</code> 的值为 0 或 1。</li>
</ul>