Find Valid Matrix Given Row and Column Sums LeetCode solution in JavaScript

1
var restoreMatrix = function (rowSum, colSum) {
2
let matrix = new Array(rowSum.length);
3
for (let i = 0; i < matrix.length; i++) {
4
matrix[i] = new Array(colSum.length).fill(0);
5
}
6
let helper = function (row, col, mat) {
7
let rowmin = Math.min(...row);
8
let colmin = Math.min(...col);
9
let i = col.indexOf(colmin);
10
let j = row.indexOf(rowmin);
11
if (rowmin === Infinity || colmin === Infinity) return 0;
12
if (rowmin < colmin) {
13
mat[j][i] = rowmin;
14
col[i] -= row[j];
15
row[j] = Infinity;
16
} else {
17
mat[j][i] = colmin;
18
row[j] -= col[i];
19
col[i] = Infinity;
20
}
21

22
return helper(rowSum, colSum, matrix);
23
};
24

25
helper(rowSum, colSum, matrix);
26

27
return matrix;
28
};

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0