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

No.1380.Lucky Numbers in a Matrix

Author: YangFong

solution/1300-1399/1380.Lucky Numbers in a Matrix/README.md

@@ -167,6 +167,34 @@ func max(a, b int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function luckyNumbers(matrix: number[][]): number[] {
+    const m = matrix.length;
+    const n = matrix[0].length;
+    const col = new Array(n).fill(0);
+    const res = [];
+    for (let j = 0; j < n; j++) {
+        for (let i = 0; i < m; i++) {
+            col[j] = Math.max(col[j], matrix[i][j]);
+        }
+    }
+    for (let x = 0; x < m; x++) {
+        let i = 0;
+        for (let y = 1; y < n; y++) {
+            if (matrix[x][i] > matrix[x][y]) {
+                i = y;
+            }
+        }
+        if (matrix[x][i] === col[i]) {
+            res.push(col[i]);
+        }
+    }
+    return res;
+}
+```
+
 ### **Rust**
 
 ```rust

solution/1300-1399/1380.Lucky Numbers in a Matrix/README_EN.md

@@ -153,6 +153,34 @@ func max(a, b int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function luckyNumbers(matrix: number[][]): number[] {
+    const m = matrix.length;
+    const n = matrix[0].length;
+    const col = new Array(n).fill(0);
+    const res = [];
+    for (let j = 0; j < n; j++) {
+        for (let i = 0; i < m; i++) {
+            col[j] = Math.max(col[j], matrix[i][j]);
+        }
+    }
+    for (let x = 0; x < m; x++) {
+        let i = 0;
+        for (let y = 1; y < n; y++) {
+            if (matrix[x][i] > matrix[x][y]) {
+                i = y;
+            }
+        }
+        if (matrix[x][i] === col[i]) {
+            res.push(col[i]);
+        }
+    }
+    return res;
+}
+```
+
 ### **Rust**
 
 ```rust

solution/1300-1399/1380.Lucky Numbers in a Matrix/Solution.ts

@@ -0,0 +1,23 @@
+function luckyNumbers(matrix: number[][]): number[] {
+    const m = matrix.length;
+    const n = matrix[0].length;
+    const col = new Array(n).fill(0);
+    const res = [];
+    for (let j = 0; j < n; j++) {
+        for (let i = 0; i < m; i++) {
+            col[j] = Math.max(col[j], matrix[i][j]);
+        }
+    }
+    for (let x = 0; x < m; x++) {
+        let i = 0;
+        for (let y = 1; y < n; y++) {
+            if (matrix[x][i] > matrix[x][y]) {
+                i = y;
+            }
+        }
+        if (matrix[x][i] === col[i]) {
+            res.push(col[i]);
+        }
+    }
+    return res;
+}