Skip to content

Commit 6a6fdec

Browse files
committed
Update 행렬의-덧셈.js
2022.03.25 / 행렬의 덧셈 풀이 추가
1 parent 6b106f2 commit 6a6fdec

File tree

1 file changed

+27
-14
lines changed

1 file changed

+27
-14
lines changed

level-1/행렬의-덧셈.js

Lines changed: 27 additions & 14 deletions
Original file line numberDiff line numberDiff line change
@@ -2,23 +2,36 @@
22
//완벽한 정답이 아닙니다.
33
//정답 1 - codeisneverodd
44
function solution(arr1, arr2) {
5-
var answer = [];
6-
arr1.forEach((row, rowIndex) => {
7-
answer.push(row.map((col, colIndex) => col + arr2[rowIndex][colIndex]))
8-
})
9-
return answer;
5+
var answer = [];
6+
arr1.forEach((row, rowIndex) => {
7+
answer.push(row.map((col, colIndex) => col + arr2[rowIndex][colIndex]));
8+
});
9+
return answer;
1010
}
1111

1212
//정답 2 - codeisneverodd
1313
function solution(arr1, arr2) {
14-
var answer = new Array(arr1.length)
15-
for (let i = 0; i < arr1.length; i++) {
16-
answer[i] = new Array(arr1[0].length)
14+
var answer = new Array(arr1.length);
15+
for (let i = 0; i < arr1.length; i++) {
16+
answer[i] = new Array(arr1[0].length);
17+
}
18+
for (let row = 0; row < answer.length; row++) {
19+
for (let col = 0; col < answer[0].length; col++) {
20+
answer[row][col] = arr1[row][col] + arr2[row][col];
1721
}
18-
for (let row = 0; row < answer.length; row++) {
19-
for (let col = 0; col < answer[0].length; col++) {
20-
answer[row][col] = arr1[row][col] + arr2[row][col]
21-
}
22+
}
23+
return answer;
24+
}
25+
26+
//정답 3 - chaerin-dev
27+
function solution(arr1, arr2) {
28+
var answer = [];
29+
for (let i = 0; i < arr1.length; i++) {
30+
let ans_row = [];
31+
for (let j = 0; j < arr1[0].length; j++) {
32+
ans_row.push(arr1[i][j] + arr2[i][j]);
2233
}
23-
return answer;
24-
}
34+
answer.push(ans_row);
35+
}
36+
return answer;
37+
}

0 commit comments

Comments
 (0)