feat: add ts solution to lc problem: No.0735 (doocs#1256)

Author: thinkasany

solution/0700-0799/0735.Asteroid Collision/README.md

@@ -210,6 +210,33 @@ func asteroidCollision(asteroids []int) []int {
 }
 ```
 
+### TypeScript
+
+```ts
+function asteroidCollision(asteroids: number[]): number[] {
+    const ans: number[] = [];
+    for (const a of asteroids) {
+        if (a > 0) {
+            ans.push(a);
+        } else {
+            while (
+                ans.length &&
+                0 < ans[ans.length - 1] &&
+                ans[ans.length - 1] < -a
+            ) {
+                ans.pop();
+            }
+            if (ans.length && ans[ans.length - 1] === -a) {
+                ans.pop();
+            } else if (!ans.length || ans[ans.length - 1] < -a) {
+                ans.push(a);
+            }
+        }
+    }
+    return ans;
+}
+```
+
 ### **...**
 
 ```

solution/0700-0799/0735.Asteroid Collision/README_EN.md

@@ -201,6 +201,33 @@ func asteroidCollision(asteroids []int) []int {
 }
 ```
 
+### TypeScript
+
+```ts
+function asteroidCollision(asteroids: number[]): number[] {
+    const ans: number[] = [];
+    for (const a of asteroids) {
+        if (a > 0) {
+            ans.push(a);
+        } else {
+            while (
+                ans.length &&
+                0 < ans[ans.length - 1] &&
+                ans[ans.length - 1] < -a
+            ) {
+                ans.pop();
+            }
+            if (ans.length && ans[ans.length - 1] === -a) {
+                ans.pop();
+            } else if (!ans.length || ans[ans.length - 1] < -a) {
+                ans.push(a);
+            }
+        }
+    }
+    return ans;
+}
+```
+
 ### **...**
 
 ```

solution/0700-0799/0735.Asteroid Collision/Solution.ts

@@ -0,0 +1,22 @@
+function asteroidCollision(asteroids: number[]): number[] {
+    const ans: number[] = [];
+    for (const a of asteroids) {
+        if (a > 0) {
+            ans.push(a);
+        } else {
+            while (
+                ans.length &&
+                0 < ans[ans.length - 1] &&
+                ans[ans.length - 1] < -a
+            ) {
+                ans.pop();
+            }
+            if (ans.length && ans[ans.length - 1] === -a) {
+                ans.pop();
+            } else if (!ans.length || ans[ans.length - 1] < -a) {
+                ans.push(a);
+            }
+        }
+    }
+    return ans;
+}