Longest Subarray of 1's After Deleting One Element

Statement

Given a binary array nums, remove exactly one element from it. Return the length of the longest non-empty subarray consisting entirely of $1$'s in the resulting array. If no such subarray exists, return $0$ ...