feat: add solutions to lc problem: No.2126

No.2126.Destroying Asteroids

Author: yanglbme

solution/2100-2199/2126.Destroying Asteroids/README.md

@@ -50,22 +50,77 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
+**方法一：排序 + 贪心**
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def asteroidsDestroyed(self, mass: int, asteroids: List[int]) -> bool:
+        asteroids.sort()
+        for v in asteroids:
+            if mass < v:
+                return False
+            mass += v
+        return True
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public boolean asteroidsDestroyed(int mass, int[] asteroids) {
+        Arrays.sort(asteroids);
+        long m = mass;
+        for (int v : asteroids) {
+            if (m < v) {
+                return false;
+            }
+            m += v;
+        }
+        return true;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    bool asteroidsDestroyed(int mass, vector<int>& asteroids) {
+        sort(asteroids.begin(), asteroids.end());
+        long long m = mass;
+        for (int v : asteroids)
+        {
+            if (m < v) return false;
+            m += v;
+        }
+        return true;
+    }
+};
+```
 
+### **Go**
+
+```go
+func asteroidsDestroyed(mass int, asteroids []int) bool {
+	m := mass
+	sort.Ints(asteroids)
+	for _, v := range asteroids {
+		if m < v {
+			return false
+		}
+		m += v
+	}
+	return true
+}
 ```
 
 ### **TypeScript**

solution/2100-2199/2126.Destroying Asteroids/README_EN.md

@@ -51,13 +51,66 @@ This is less than 23, so a collision would not destroy the last asteroid.</pre>
 ### **Python3**
 
 ```python
-
+class Solution:
+    def asteroidsDestroyed(self, mass: int, asteroids: List[int]) -> bool:
+        asteroids.sort()
+        for v in asteroids:
+            if mass < v:
+                return False
+            mass += v
+        return True
 ```
 
 ### **Java**
 
 ```java
+class Solution {
+    public boolean asteroidsDestroyed(int mass, int[] asteroids) {
+        Arrays.sort(asteroids);
+        long m = mass;
+        for (int v : asteroids) {
+            if (m < v) {
+                return false;
+            }
+            m += v;
+        }
+        return true;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    bool asteroidsDestroyed(int mass, vector<int>& asteroids) {
+        sort(asteroids.begin(), asteroids.end());
+        long long m = mass;
+        for (int v : asteroids)
+        {
+            if (m < v) return false;
+            m += v;
+        }
+        return true;
+    }
+};
+```
 
+### **Go**
+
+```go
+func asteroidsDestroyed(mass int, asteroids []int) bool {
+	m := mass
+	sort.Ints(asteroids)
+	for _, v := range asteroids {
+		if m < v {
+			return false
+		}
+		m += v
+	}
+	return true
+}
 ```
 
 ### **TypeScript**

solution/2100-2199/2126.Destroying Asteroids/Solution.cpp

@@ -0,0 +1,13 @@
+class Solution {
+public:
+    bool asteroidsDestroyed(int mass, vector<int>& asteroids) {
+        sort(asteroids.begin(), asteroids.end());
+        long long m = mass;
+        for (int v : asteroids)
+        {
+            if (m < v) return false;
+            m += v;
+        }
+        return true;
+    }
+};

solution/2100-2199/2126.Destroying Asteroids/Solution.go

@@ -0,0 +1,11 @@
+func asteroidsDestroyed(mass int, asteroids []int) bool {
+	m := mass
+	sort.Ints(asteroids)
+	for _, v := range asteroids {
+		if m < v {
+			return false
+		}
+		m += v
+	}
+	return true
+}

solution/2100-2199/2126.Destroying Asteroids/Solution.java

@@ -0,0 +1,13 @@
+class Solution {
+    public boolean asteroidsDestroyed(int mass, int[] asteroids) {
+        Arrays.sort(asteroids);
+        long m = mass;
+        for (int v : asteroids) {
+            if (m < v) {
+                return false;
+            }
+            m += v;
+        }
+        return true;
+    }
+}

solution/2100-2199/2126.Destroying Asteroids/Solution.py

@@ -0,0 +1,8 @@
+class Solution:
+    def asteroidsDestroyed(self, mass: int, asteroids: List[int]) -> bool:
+        asteroids.sort()
+        for v in asteroids:
+            if mass < v:
+                return False
+            mass += v
+        return True