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

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

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 <code>1</code>&#39;s in the resulting array. Return <code>0</code> 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 <code>0</code> or <code>1</code>.</li>
</ul>

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

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

请你在删掉元素的结果数组中，返回最长的且只包含 1 的非空子数组的长度。

如果不存在这样的子数组，请返回 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>&nbsp;要么是&nbsp;<code>0</code>&nbsp;要么是&nbsp;<code>1</code> 。</li>
</ul>