solution: 1493. Longest Subarray of 1's After Deleting One Element

Author: flynnpark

solutions/solution_1493/__init__.py

@@ -3,4 +3,18 @@
 
 class Solution:
     def longestSubarray(self, nums: List[int]) -> int:
-        ...
+        left = 0
+        zero_count = 0
+        max_length = 0
+        for right in range(len(nums)):
+            if nums[right] == 0:
+                zero_count += 1
+
+            while zero_count > 1:
+                if nums[left] == 0:
+                    zero_count -= 1
+                left += 1
+
+            max_length = max(max_length, right - left)
+
+        return max_length