feat: add typescript solution to lc problem: No.1337.The K Weakest Rows in a Matrix (doocs#533)

Author: zhaocchen

solution/1300-1399/1337.The K Weakest Rows in a Matrix/README.md

@@ -134,6 +134,26 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function kWeakestRows(mat: number[][], k: number): number[] {
+    let n = mat.length;
+    let sumMap = mat.map((d, i)=> ([d.reduce((a, c) => a + c, 0), i]));
+    let ans = [];
+    // 冒泡排序
+    for (let i = 0; i < k; i++) {
+        for (let j = i; j < n; j++) {
+            if (sumMap[j][0] < sumMap[i][0] || (sumMap[j][0] == sumMap[i][0]) && sumMap[i][1] > sumMap[j][1]) {
+                [sumMap[i], sumMap[j]] = [sumMap[j], sumMap[i]];
+            }
+        }
+        ans.push(sumMap[i][1]);
+    }
+    return ans;
+};
+```
+
 ### **...**
 
 ```

solution/1300-1399/1337.The K Weakest Rows in a Matrix/README_EN.md

@@ -127,6 +127,26 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function kWeakestRows(mat: number[][], k: number): number[] {
+    let n = mat.length;
+    let sumMap = mat.map((d, i)=> ([d.reduce((a, c) => a + c, 0), i]));
+    let ans = [];
+    // 冒泡排序
+    for (let i = 0; i < k; i++) {
+        for (let j = i; j < n; j++) {
+            if (sumMap[j][0] < sumMap[i][0] || (sumMap[j][0] == sumMap[i][0]) && sumMap[i][1] > sumMap[j][1]) {
+                [sumMap[i], sumMap[j]] = [sumMap[j], sumMap[i]];
+            }
+        }
+        ans.push(sumMap[i][1]);
+    }
+    return ans;
+};
+```
+
 ### **...**
 
 ```

solution/1300-1399/1337.The K Weakest Rows in a Matrix/Solution.ts

@@ -0,0 +1,15 @@
+function kWeakestRows(mat: number[][], k: number): number[] {
+    let n = mat.length;
+    let sumMap = mat.map((d, i)=> ([d.reduce((a, c) => a + c, 0), i]));
+    let ans = [];
+    // 冒泡排序
+    for (let i = 0; i < k; i++) {
+        for (let j = i; j < n; j++) {
+            if (sumMap[j][0] < sumMap[i][0] || (sumMap[j][0] == sumMap[i][0]) && sumMap[i][1] > sumMap[j][1]) {
+                [sumMap[i], sumMap[j]] = [sumMap[j], sumMap[i]];
+            }
+        }
+        ans.push(sumMap[i][1]);
+    }
+    return ans;
+};