add 1574

fishercoder1534 · fishercoder1534 · commit 468013af1058 · 2020-09-05T09:44:14.000-07:00
diff --git a/README.md b/README.md
@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ &#9733;
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1574|[Shortest Subarray to be Removed to Make Array Sorted](https://leetcode.com/problems/shortest-subarray-to-be-removed-to-make-array-sorted/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1574.java) ||Array, Binary Search|Medium|
 |1572|[Matrix Diagonal Sum](https://leetcode.com/problems/matrix-diagonal-sum/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1572.java) ||Array|Easy|
 |1567|[Maximum Length of Subarray With Positive Product](https://leetcode.com/problems/maximum-length-of-subarray-with-positive-product/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1567.java) |[:tv:](https://youtu.be/bFer5PdsgpY)|Greedy|Medium|
 |1566|[Detect Pattern of Length M Repeated K or More Times](https://leetcode.com/problems/detect-pattern-of-length-m-repeated-k-or-more-times/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1566.java) |[:tv:](https://youtu.be/aJAV_VgmjdE)|Array|Easy|
diff --git a/src/main/java/com/fishercoder/solutions/_1574.java b/src/main/java/com/fishercoder/solutions/_1574.java
@@ -0,0 +1,34 @@
+package com.fishercoder.solutions;
+
+public class _1574 {
+    public static class Solution1 {
+        public int findLengthOfShortestSubarray(int[] arr) {
+            int left = 0;
+            while (left < arr.length - 1 && arr[left] <= arr[left + 1]) {
+                left++;
+            }
+            if (left == arr.length - 1) {
+                return 0;
+            }
+            int right = arr.length - 1;
+            while (right > left && arr[right] >= arr[right - 1]) {
+                right--;
+            }
+            if (right == 0) {
+                return arr.length - 1;
+            }
+            int result = Math.min(arr.length - left - 1, right);
+            int i = 0;
+            int j = right;
+            while (i <= left && j < arr.length) {
+                if (arr[j] >= arr[i]) {
+                    result = Math.min(result, j - i - 1);
+                    i++;
+                } else {
+                    j++;
+                }
+            }
+            return result;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1574Test.java b/src/test/java/com/fishercoder/_1574Test.java
@@ -0,0 +1,24 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1574;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static junit.framework.TestCase.assertEquals;
+
+public class _1574Test {
+    private static _1574.Solution1 solution1;
+    private static int[] arr;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1574.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        arr = new int[]{1, 2, 3, 10, 4, 2, 3, 5};
+        assertEquals(3, solution1.findLengthOfShortestSubarray(arr));
+    }
+
+}
