feat: add ts solution to lc problem: No.2500 (#1301)

Author: thinkasany

solution/2500-2599/2500.Delete Greatest Value in Each Row/README.md

@@ -175,6 +175,27 @@ impl Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function deleteGreatestValue(grid: number[][]): number {
+    for (const row of grid) {
+        row.sort((a, b) => a - b);
+    }
+
+    let ans = 0;
+    for (let j = 0; j < grid[0].length; ++j) {
+        let t = 0;
+        for (let i = 0; i < grid.length; ++i) {
+            t = Math.max(t, grid[i][j]);
+        }
+        ans += t;
+    }
+
+    return ans;
+}
+```
+
 ### **...**
 
 ```

solution/2500-2599/2500.Delete Greatest Value in Each Row/README_EN.md

@@ -153,6 +153,27 @@ impl Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function deleteGreatestValue(grid: number[][]): number {
+    for (const row of grid) {
+        row.sort((a, b) => a - b);
+    }
+
+    let ans = 0;
+    for (let j = 0; j < grid[0].length; ++j) {
+        let t = 0;
+        for (let i = 0; i < grid.length; ++i) {
+            t = Math.max(t, grid[i][j]);
+        }
+        ans += t;
+    }
+
+    return ans;
+}
+```
+
 ### **...**
 
 ```

solution/2500-2599/2500.Delete Greatest Value in Each Row/Solution.ts

@@ -0,0 +1,16 @@
+function deleteGreatestValue(grid: number[][]): number {
+    for (const row of grid) {
+        row.sort((a, b) => a - b);
+    }
+
+    let ans = 0;
+    for (let j = 0; j < grid[0].length; ++j) {
+        let t = 0;
+        for (let i = 0; i < grid.length; ++i) {
+            t = Math.max(t, grid[i][j]);
+        }
+        ans += t;
+    }
+
+    return ans;
+}