add 2091

Author: fishercoder1534

README.md

@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ ★
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                  
 |-----|----------------|---------------|--------|-------------|-------------
+|2091|[Removing Minimum and Maximum From Array](https://leetcode.com/problems/removing-minimum-and-maximum-from-array/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2091.java) ||Medium||
 |2090|[K Radius Subarray Averages](https://leetcode.com/problems/k-radius-subarray-averages/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2090.java) ||Medium||
 |2089|[Find Target Indices After Sorting Array](https://leetcode.com/problems/find-target-indices-after-sorting-array/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2089.java) ||Easy||
 |2086|[Minimum Number of Buckets Required to Collect Rainwater from Houses](https://leetcode.com/problems/minimum-number-of-buckets-required-to-collect-rainwater-from-houses/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2086.java) ||Medium||

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

@@ -0,0 +1,60 @@
+package com.fishercoder.solutions;
+
+public class _2091 {
+    public static class Solution1 {
+        public int minimumDeletions(int[] nums) {
+            int minIndex = 0;
+            int maxIndex = 0;
+            int min = nums[0];
+            int max = nums[0];
+            for (int i = 1; i < nums.length; i++) {
+                if (nums[i] > max) {
+                    max = nums[i];
+                    maxIndex = i;
+                }
+                if (nums[i] < min) {
+                    min = nums[i];
+                    minIndex = i;
+                }
+            }
+            int minDeletions = 0;
+            if (nums.length == 1) {
+                return 1;
+            }
+            int len = nums.length - 1;
+            int firstIndex = maxIndex > minIndex ? minIndex : maxIndex;
+            int secondIndex = maxIndex == firstIndex ? minIndex : maxIndex;
+            int firstDistance = firstIndex;
+            int lastDistance = len - secondIndex;
+            int betweenDistance = secondIndex - firstIndex;
+            if (firstDistance < lastDistance) {
+                minDeletions += firstDistance;
+                minDeletions++;
+                if (betweenDistance == 1 || lastDistance == 0) {
+                    minDeletions++;
+                    return minDeletions;
+                }
+                if (betweenDistance <= lastDistance) {
+                    minDeletions += betweenDistance;
+                } else {
+                    minDeletions += lastDistance;
+                    minDeletions++;
+                }
+            } else {
+                minDeletions += lastDistance;
+                minDeletions++;
+                if (betweenDistance == 1 || firstDistance == 0) {
+                    minDeletions++;
+                    return minDeletions;
+                }
+                if (betweenDistance <= firstDistance) {
+                    minDeletions += betweenDistance;
+                } else {
+                    minDeletions += firstDistance;
+                    minDeletions++;
+                }
+            }
+            return minDeletions;
+        }
+    }
+}