Package g1401_1500.s1493_longest_subarray_of_1s_after_deleting_one_element

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    1493 - Longest Subarray of 1's After Deleting One Element\.

    Medium

    Given a binary array nums, you should delete one element from it.

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

    Example 1:

    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's.

    Example 2:

    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's is 1,1,1,1,1.

    Example 3:

    Input: nums = 1,1,1

    Output: 2

    Explanation: You must delete one element.

    Constraints:

    • <code>1 <= nums.length <= 10<sup>5</sup></code>

    • nums[i] is either 0 or 1.

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer longestSubarray(IntArray nums)

      • Methods inherited from class java.lang.Object

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