refactor 1493

Author: fishercoder1534

README.md

@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ ★
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1493|[Longest Subarray of 1's After Deleting One Element](https://leetcode.com/problems/longest-subarray-of-1s-after-deleting-one-element/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1493.java) | |Medium|Array|
 |1492|[The kth Factor of n](https://leetcode.com/problems/the-kth-factor-of-n/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1492.java) | |Medium|Math|
 |1491|[Average Salary Excluding the Minimum and Maximum Salary](https://leetcode.com/problems/average-salary-excluding-the-minimum-and-maximum-salary/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1491.java) | |Easy|Array, Sort|
 |1487|[Making File Names Unique](https://leetcode.com/problems/making-file-names-unique/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1487.java) | |Medium|HashTable, String|

src/main/java/com/fishercoder/solutions/_1493.java

@@ -0,0 +1,42 @@
+package com.fishercoder.solutions;
+
+import java.util.ArrayList;
+import java.util.List;
+
+public class _1493 {
+    public static class Solution1 {
+        public int longestSubarray(int[] nums) {
+            List<int[]> brackets = new ArrayList<>();
+            for (int i = 0; i < nums.length; i++) {
+                if (nums[i] == 1) {
+                    int right = i + 1;
+                    while (right < nums.length && nums[right] == 1) {
+                        right++;
+                    }
+                    if (right < nums.length && nums[right] == 1) {
+                        brackets.add(new int[]{i, right});
+                    } else {
+                        brackets.add(new int[]{i, right - 1});
+                    }
+                    i = right;
+                }
+            }
+            int longest = 0;
+            for (int[] bracket : brackets) {
+                if (bracket[1] == nums.length - 1 && bracket[0] == 0) {
+                    return nums.length - 1;
+                }
+                longest = Math.max(bracket[1] - bracket[0] + 1, longest);
+            }
+            for (int i = 0; i < brackets.size() - 1; i++) {
+                int[] first = brackets.get(i);
+                int[] second = brackets.get(i + 1);
+                if (first[1] + 2 == second[0]) {
+                    int connected = (first[1] - first[0] + 1) + (second[1] - second[0] + 1);
+                    longest = Math.max(longest, connected);
+                }
+            }
+            return longest;
+        }
+    }
+}

src/test/java/com/fishercoder/_1493Test.java

@@ -0,0 +1,24 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1493;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static junit.framework.TestCase.assertEquals;
+
+public class _1493Test {
+    private static _1493.Solution1 solution1;
+    private static int[] nums;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1493.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        nums = new int[]{1, 1, 0, 1};
+        assertEquals(3, solution1.longestSubarray(nums));
+    }
+
+}