Package g1401_1500.s1493_longest_subarray_of_1s_after_deleting_one_element

Class Solution

java.lang.Object

g1401_1500.s1493_longest_subarray_of_1s_after_deleting_one_element.Solution

public class Solution
extends Object

1493 - Longest Subarray of 1&rsquo;s After Deleting One Element.<p>Medium</p> <p>Given a binary array <code>nums</code>, you should delete one element from it.</p> <p>Return <em>the size of the longest non-empty subarray containing only</em> <code>1</code><em>&rsquo;s in the resulting array</em>. Return <code>0</code> if there is no such subarray.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> nums = [1,1,0,1]</p> <p><strong>Output:</strong> 3</p> <p><strong>Explanation:</strong> After deleting the number in position 2, [1,1,1] contains 3 numbers with value of 1&rsquo;s.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> nums = [0,1,1,1,0,1,1,0,1]</p> <p><strong>Output:</strong> 5</p> <p><strong>Explanation:</strong> After deleting the number in position 4, [0,1,1,1,1,1,0,1] longest subarray with value of 1&rsquo;s is [1,1,1,1,1].</p> <p><strong>Example 3:</strong></p> <p><strong>Input:</strong> nums = [1,1,1]</p> <p><strong>Output:</strong> 2</p> <p><strong>Explanation:</strong> You must delete one element.</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= nums.length <= 10⁵</code></li> <li><code>nums[i]</code> is either <code>0</code> or <code>1</code>.</li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	longestSubarray(int[] nums)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

longestSubarray

public int longestSubarray(int[] nums)