aboutsummaryrefslogtreecommitdiff
path: root/longest_subarr_ones.py
blob: a4b362301dd6332644cec415607222df7207c63f (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
# 1493. Longest Subarray of 1's After Deleting One Element

"""
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.
"""


class Solution(object):
    def longestSubarray(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        left, zeros, ans = 0, 0, 0
        for right in range(len(nums)):
            if nums[right] == 0:
                zeros += 1
            while zeros > 1:
                if nums[left] == 0:
                    zeros -= 1
                left += 1
            ans = max(ans, right - left)
        return ans


if __name__ == "__main__":
    obj = Solution()
    print(obj.longestSubarray(nums=[1, 1, 0, 1]))
    print(obj.longestSubarray(nums=[0, 1, 1, 1, 0, 1, 1, 0, 1]))
    print(obj.longestSubarray(nums=[1, 1, 1]))