feat: add ts solution to lc problem: No.2751

Author: rain84

solution/2700-2799/2751.Robot Collisions/README.md

@@ -272,6 +272,49 @@ func survivedRobotsHealths(positions []int, healths []int, directions string) []
 }
 ```
 
+#### TypeScript
+
+```ts
+function survivedRobotsHealths(
+    positions: number[],
+    healths: number[],
+    directions: string,
+): number[] {
+    const idx = Array.from({ length: positions.length }, (_, i) => i);
+    const stk: number[] = [];
+
+    idx.sort((a, b) => positions[a] - positions[b]);
+
+    for (let iRight of idx) {
+        while (stk.length) {
+            const iLeft = stk.at(-1)!;
+            const havePair = directions[iLeft] === 'R' && directions[iRight] === 'L';
+            if (!havePair) break;
+
+            if (healths[iLeft] === healths[iRight]) {
+                healths[iLeft] = healths[iRight] = iRight = -1;
+                stk.pop();
+                break;
+            }
+
+            if (healths[iLeft] < healths[iRight]) {
+                healths[iLeft] = -1;
+                healths[iRight]--;
+                stk.pop();
+            } else {
+                healths[iRight] = iRight = -1;
+                healths[iLeft]--;
+                break;
+            }
+        }
+
+        if (iRight !== -1) stk.push(iRight);
+    }
+
+    return healths.filter(i => ~i);
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/2700-2799/2751.Robot Collisions/README_EN.md

@@ -272,6 +272,49 @@ func survivedRobotsHealths(positions []int, healths []int, directions string) []
 }
 ```
 
+#### TypeScript
+
+```ts
+function survivedRobotsHealths(
+    positions: number[],
+    healths: number[],
+    directions: string,
+): number[] {
+    const idx = Array.from({ length: positions.length }, (_, i) => i);
+    const stk: number[] = [];
+
+    idx.sort((a, b) => positions[a] - positions[b]);
+
+    for (let iRight of idx) {
+        while (stk.length) {
+            const iLeft = stk.at(-1)!;
+            const havePair = directions[iLeft] === 'R' && directions[iRight] === 'L';
+            if (!havePair) break;
+
+            if (healths[iLeft] === healths[iRight]) {
+                healths[iLeft] = healths[iRight] = iRight = -1;
+                stk.pop();
+                break;
+            }
+
+            if (healths[iLeft] < healths[iRight]) {
+                healths[iLeft] = -1;
+                healths[iRight]--;
+                stk.pop();
+            } else {
+                healths[iRight] = iRight = -1;
+                healths[iLeft]--;
+                break;
+            }
+        }
+
+        if (iRight !== -1) stk.push(iRight);
+    }
+
+    return healths.filter(i => ~i);
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/2700-2799/2751.Robot Collisions/Solution.ts

@@ -0,0 +1,38 @@
+function survivedRobotsHealths(
+    positions: number[],
+    healths: number[],
+    directions: string,
+): number[] {
+    const idx = Array.from({ length: positions.length }, (_, i) => i);
+    const stk: number[] = [];
+
+    idx.sort((a, b) => positions[a] - positions[b]);
+
+    for (let iRight of idx) {
+        while (stk.length) {
+            const iLeft = stk.at(-1)!;
+            const havePair = directions[iLeft] === 'R' && directions[iRight] === 'L';
+            if (!havePair) break;
+
+            if (healths[iLeft] === healths[iRight]) {
+                healths[iLeft] = healths[iRight] = iRight = -1;
+                stk.pop();
+                break;
+            }
+
+            if (healths[iLeft] < healths[iRight]) {
+                healths[iLeft] = -1;
+                healths[iRight]--;
+                stk.pop();
+            } else {
+                healths[iRight] = iRight = -1;
+                healths[iLeft]--;
+                break;
+            }
+        }
+
+        if (iRight !== -1) stk.push(iRight);
+    }
+
+    return healths.filter(i => ~i);
+}