forked from jeantimex/javascript-problems-and-solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsparse-matrix-multiplication.js
59 lines (54 loc) · 1004 Bytes
/
sparse-matrix-multiplication.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
/**
* Sparse Matrix Multiplication
*
* Given two sparse matrices A and B, return the result of AB.
*
* You may assume that A's column number is equal to B's row number.
*
* Example:
*
* Input:
*
* A = [
* [ 1, 0, 0],
* [-1, 0, 3]
* ]
*
* B = [
* [ 7, 0, 0 ],
* [ 0, 0, 0 ],
* [ 0, 0, 1 ]
* ]
*
* Output:
*
* | 1 0 0 | | 7 0 0 | | 7 0 0 |
* AB = | -1 0 3 | x | 0 0 0 | = | -7 0 3 |
* | 0 0 1 |
*/
/**
* @param {number[][]} A
* @param {number[][]} B
* @return {number[][]}
*/
const multiply = (A, B) => {
const mA = A.length;
const nA = A[0].length;
const nB = B[0].length;
const C = Array(mA)
.fill()
.map(() => Array(nB).fill(0));
for (let i = 0; i < mA; i++) {
for (let k = 0; k < nA; k++) {
if (A[i][k] !== 0) {
for (let j = 0; j < nB; j++) {
if (B[k][j] != 0) {
C[i][j] += A[i][k] * B[k][j];
}
}
}
}
}
return C;
};
export { multiply };