add 2126

fishercoder1534 · fishercoder1534 · commit c6eb11164776 · 2022-01-02T09:14:20.000-08: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                  
 |-----|----------------|---------------|--------|-------------|-------------
+|2126|[Destroying Asteroids](https://leetcode.com/problems/destroying-asteroids/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2126.java) ||Medium||
 |2125|[Number of Laser Beams in a Bank](https://leetcode.com/problems/number-of-laser-beams-in-a-bank/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2125.java) ||Medium||
 |2124|[Check if All A's Appears Before All B's](https://leetcode.com/problems/check-if-all-as-appears-before-all-bs/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2124.java) ||Easy||
 |2120|[Execution of All Suffix Instructions Staying in a Grid](https://leetcode.com/problems/execution-of-all-suffix-instructions-staying-in-a-grid/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2120.java) ||Medium||
diff --git a/src/main/java/com/fishercoder/solutions/_2126.java b/src/main/java/com/fishercoder/solutions/_2126.java
@@ -0,0 +1,56 @@
+package com.fishercoder.solutions;
+
+import java.util.Arrays;
+import java.util.Collections;
+import java.util.HashMap;
+import java.util.List;
+import java.util.Map;
+import java.util.Set;
+
+public class _2126 {
+    public static class Solution1 {
+        public boolean asteroidsDestroyed(int mass, int[] asteroids) {
+            Map<Integer, Integer> map = new HashMap<>();
+            for (int a : asteroids) {
+                map.put(a, map.getOrDefault(a, 0) + 1);
+            }
+            int[] nums = new int[map.keySet().size()];
+            int i = 0;
+            for (int key : map.keySet()) {
+                nums[i++] = key;
+            }
+            Arrays.sort(nums);
+            int startIndex = 0;
+            long sum = mass;
+            int upToIndex = binarySearch(sum, nums, startIndex, nums.length - 1);
+            while (upToIndex < nums.length) {
+                for (i = startIndex; i <= upToIndex; i++) {
+                    sum += (long) map.get(nums[i]) * nums[i];
+                }
+                if (upToIndex == nums.length - 1) {
+                    return true;
+                }
+                startIndex = upToIndex + 1;
+                upToIndex = binarySearch(sum, nums, startIndex, nums.length - 1);
+                if (startIndex > upToIndex) {
+                    return false;
+                }
+            }
+            return true;
+        }
+
+        private int binarySearch(long sum, int[] nums, int left, int right) {
+            while (left < right) {
+                int mid = left + (right - left) / 2;
+                if (nums[mid] < sum) {
+                    left = mid + 1;
+                } else if (nums[mid] > sum) {
+                    right = mid - 1;
+                } else {
+                    return mid;
+                }
+            }
+            return right < nums.length && nums[right] <= sum ? right : left - 1;
+        }
+    }
+}
