<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:
        if 0 not in nums:
            return len(nums)-1

        i = 0
        k = 1
        max_len = 0
        for j in range(len(nums)):
            if nums[j] == 0:
                k -= 1
            
            while k < 0:
                if nums[i] == 0:
                    k += 1
                i += 1
            if max_len < (j - i):
                max_len = (j-i)
        return max_len
            







        # max_arr = 0

        # cnt = 0
        # k = 1
        # j = i = 0
        # while i < len(nums):
        #     if nums[i] == 0 and k==1:
        #         k -= 1
        #         i += 1
        #     elif nums[i] == 0:
        #         if max_arr < cnt:
        #             max_arr = cnt
        #         cnt = 0
        #         k += 1
        #         j += 1
        #         i = j
        #     elif nums[i] == 1:
        #         cnt += 1
        #         i += 1

        # if max_arr < cnt:
        #     max_arr = cnt
        # return max_arr
301