diff options
Diffstat (limited to 'longest_subarr_ones.py')
-rw-r--r-- | longest_subarr_ones.py | 32 |
1 files changed, 32 insertions, 0 deletions
diff --git a/longest_subarr_ones.py b/longest_subarr_ones.py new file mode 100644 index 0000000..a4b3623 --- /dev/null +++ b/longest_subarr_ones.py @@ -0,0 +1,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])) |