<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>&#39;s in the resulting array</em>. Return <code>0</code> if there is no such subarray.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums = [1,1,0,1]
<strong>Output:</strong> 3
<strong>Explanation:</strong> After deleting the number in position 2, [1,1,1] contains 3 numbers with value of 1&#39;s.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums = [0,1,1,1,0,1,1,0,1]
<strong>Output:</strong> 5
<strong>Explanation:</strong> 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>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> nums = [1,1,1]
<strong>Output:</strong> 2
<strong>Explanation:</strong> You must delete one element.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= nums.length &lt;= 10<sup>5</sup></code></li>
	<li><code>nums[i]</code> is either <code>0</code> or <code>1</code>.</li>
</ul>

class Solution:
    def longestSubarray(self, nums: List[int]) -> int:
        #lengthSoFar = 0
        maxLength = 0
        firstSegment = 0
        secondSegment = 0
        zero = False
        currSegment = firstSegment
        prev = None
        zero = True
        zeroPresent = False

        for i in range(len(nums)):
            if nums[i] == 1:
                currSegment += 1
                print("curr: ", currSegment)
                if i == len(nums) - 1:
                    secondSegment = currSegment
                    if secondSegment + firstSegment > maxLength:
                        print("first: ", firstSegment, "second: ", secondSegment)
                        if firstSegment == 0 or secondSegment == 0:
                            zero = False
                        else:
                            zero = True
                        maxLength = firstSegment + secondSegment
            elif nums[i] == 0:
                zeroPresent = True
                if prev == 0:
                    currSegment = 0
                    firstSegment = currSegment
                else:
                    secondSegment = currSegment
                    if firstSegment + secondSegment > maxLength:
                        print("first: ", firstSegment, "second: ", secondSegment)
                        if firstSegment == 0 or secondSegment == 0:
                            zero = False
                        else:
                            zero = True
                        maxLength = firstSegment + secondSegment
                    firstSegment = secondSegment
                    secondSegment = 0
                    currSegment = 0
            prev = nums[i]
        print(zero)
        if zero or zeroPresent:
            return maxLength
        else:
            return maxLength - 1


            

522