Skip to content

problem10.md

Latest commit

 

History

History
13 lines (10 loc) · 495 Bytes

problem10.md

File metadata and controls

13 lines (10 loc) · 495 Bytes

Problem 10: Bitwise Maximal Span (Longest Subarray of 1's After Deleting One Element)

Problem Statement

Given a binary array nums, you should delete one element from it. Return the size of the longest subarray containing only 1's in the resulting array. Return 0 if there is no such subarray.

Input Format

  • A binary array nums.

Example

Input: nums = [1, 1, 0, 1]
Output: 3
Explanation: After deleting the 0, [1, 1, 1] becomes the longest subarray with size 3.