Time: 5 ms (8.25%) | Memory: 56.8 MB (43.46%) - LeetSync

Author: David-Hackro

1586-longest-subarray-of-1s-after-deleting-one-element/longest-subarray-of-1s-after-deleting-one-element.java

@@ -0,0 +1,25 @@
+class Solution {
+    public int longestSubarray(int[] nums) {
+        int l = 0;
+        int r = 0;
+        int result = 0;
+        int ones = 0;
+        int zeros = 0;
+
+        for(; r < nums.length; r++) {
+            ones += nums[r] == 1?1:0;
+            zeros += nums[r] == 0?1:0;
+
+            while(zeros > 1) {
+                ones -= nums[l] == 1?1:0;
+                zeros -= nums[l] == 0?1:0;
+                l++;
+            }
+        
+            result = Math.max(result, r - l +1);
+            
+        }
+
+        return result - 1;
+    }
+}