feat: add solutions to lc problem: No.1605

No.1605.Find Valid Matrix Given Row and Column Sums

Author: yanglbme

solution/1600-1699/1605.Find Valid Matrix Given Row and Column Sums/README.md

@@ -88,6 +88,8 @@
 
 因此，我们把原问题缩小为一个 $m-1$ 行和 $n$ 列的子问题，继续进行上述的操作，直到 $rowSum$ 和 $colSum$ 中的所有元素都为 $0$，就可以得到一个满足题目要求的矩阵 $ans$。
 
+时间复杂度 $O(m \times n)$，空间复杂度 $O(m \times n)$。其中 $m$ 和 $n$ 分别为 $rowSum$ 和 $colSum$ 的长度。
+
 <!-- tabs:start -->
 
 ### **Python3**
@@ -189,10 +191,9 @@ func min(a, b int) int {
  * @return {number[][]}
  */
 var restoreMatrix = function (rowSum, colSum) {
-    const [m, n] = [rowSum.length, colSum.length];
-    const ans = Array(m)
-        .fill(0)
-        .map(() => Array(n).fill(0));
+    const m = rowSum.length;
+    const n = colSum.length;
+    const ans = Array.from(new Array(m), () => new Array(n).fill(0));
     for (let i = 0; i < m; i++) {
         for (let j = 0; j < n; j++) {
             const x = Math.min(rowSum[i], colSum[j]);
@@ -205,6 +206,25 @@ var restoreMatrix = function (rowSum, colSum) {
 };
 ```
 
+### **TypeScript**
+
+```ts
+function restoreMatrix(rowSum: number[], colSum: number[]): number[][] {
+    const m = rowSum.length;
+    const n = colSum.length;
+    const ans = Array.from(new Array(m), () => new Array(n).fill(0));
+    for (let i = 0; i < m; i++) {
+        for (let j = 0; j < n; j++) {
+            const x = Math.min(rowSum[i], colSum[j]);
+            ans[i][j] = x;
+            rowSum[i] -= x;
+            colSum[j] -= x;
+        }
+    }
+    return ans;
+}
+```
+
 ### **...**
 
 ```

solution/1600-1699/1605.Find Valid Matrix Given Row and Column Sums/README_EN.md

@@ -144,10 +144,9 @@ func min(a, b int) int {
  * @return {number[][]}
  */
 var restoreMatrix = function (rowSum, colSum) {
-    const [m, n] = [rowSum.length, colSum.length];
-    const ans = Array(m)
-        .fill(0)
-        .map(() => Array(n).fill(0));
+    const m = rowSum.length;
+    const n = colSum.length;
+    const ans = Array.from(new Array(m), () => new Array(n).fill(0));
     for (let i = 0; i < m; i++) {
         for (let j = 0; j < n; j++) {
             const x = Math.min(rowSum[i], colSum[j]);
@@ -160,6 +159,25 @@ var restoreMatrix = function (rowSum, colSum) {
 };
 ```
 
+### **TypeScript**
+
+```ts
+function restoreMatrix(rowSum: number[], colSum: number[]): number[][] {
+    const m = rowSum.length;
+    const n = colSum.length;
+    const ans = Array.from(new Array(m), () => new Array(n).fill(0));
+    for (let i = 0; i < m; i++) {
+        for (let j = 0; j < n; j++) {
+            const x = Math.min(rowSum[i], colSum[j]);
+            ans[i][j] = x;
+            rowSum[i] -= x;
+            colSum[j] -= x;
+        }
+    }
+    return ans;
+}
+```
+
 ### **...**
 
 ```

solution/1600-1699/1605.Find Valid Matrix Given Row and Column Sums/Solution.js

@@ -4,10 +4,9 @@
  * @return {number[][]}
  */
 var restoreMatrix = function (rowSum, colSum) {
-    const [m, n] = [rowSum.length, colSum.length];
-    const ans = Array(m)
-        .fill(0)
-        .map(() => Array(n).fill(0));
+    const m = rowSum.length;
+    const n = colSum.length;
+    const ans = Array.from(new Array(m), () => new Array(n).fill(0));
     for (let i = 0; i < m; i++) {
         for (let j = 0; j < n; j++) {
             const x = Math.min(rowSum[i], colSum[j]);

solution/1600-1699/1605.Find Valid Matrix Given Row and Column Sums/Solution.ts

@@ -0,0 +1,14 @@
+function restoreMatrix(rowSum: number[], colSum: number[]): number[][] {
+    const m = rowSum.length;
+    const n = colSum.length;
+    const ans = Array.from(new Array(m), () => new Array(n).fill(0));
+    for (let i = 0; i < m; i++) {
+        for (let j = 0; j < n; j++) {
+            const x = Math.min(rowSum[i], colSum[j]);
+            ans[i][j] = x;
+            rowSum[i] -= x;
+            colSum[j] -= x;
+        }
+    }
+    return ans;
+}