We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent a184ff6 commit 50691f6Copy full SHA for 50691f6
jiyeeeah/[week1]Array/procession_multiply.js
@@ -0,0 +1,18 @@
1
+function solution(arr1, arr2) {
2
+ const r1 = arr1.length;
3
+ const c1 = arr1[0].length;
4
+ const r2 = arr2.length;
5
+ const c2 = arr2[0].length;
6
+ // c1 === r2임
7
+
8
+ const answer = new Array(r1).fill(0).map(() => new Array(c2).fill(0));
9
10
+ for (let i = 0; i < r1; i++) {
11
+ for (let j = 0; j < c2; j++) {
12
+ for (let k = 0; k < c1; k++) {
13
+ answer[i][j] += arr1[i][k] * arr2[k][j];
14
+ }
15
16
17
+ return answer;
18
+}
0 commit comments