출력값
[Running] node "c:\바탕 화면\백준알고리즘\SolveBaekjoon\test\7단계\n2738.js"
4 4 4
6 6 6
5 6 100
[Done] exited with code=0 in 0.076 seconds
문제해결방법
1차원 배열이라면 더하는거에 어려움을 느끼지않았는데 2차원 배열 계산법을몰라서 찾아보느라고 이해하는데 한참 걸렸습니다...ㅎㅎ
const fs = require("fs");
try {
//문제풀이용
// const input = fs
// .readFileSync("SolveBaekjoon/answer/level7/n2738.txt")
// .toString()
// .trim()
// .split("\n");
//백준제출용
const input = require("fs")
.readFileSync("/dev/stdin")
.toString()
.trim()
.split("\n");
const [N, M] = input[0].trim().split(" ").map(Number);
const readMatrix = (start, numRows) => {
return Array.from({ length: numRows }, (_, i) =>
input[start + i + 1].trim().split(" ").map(Number)
);
};
const A = readMatrix(0, N);
const B = readMatrix(N, input.length - N - 1);
const addMatrices = (matrix1, matrix2) =>
matrix1.map((row, i) => row.map((val, j) => val + matrix2[i][j]));
const resultMatrix = addMatrices(A, B);
resultMatrix.forEach((row) => console.log(row.join(" ")));
} catch (err) {
console.log(err.message);
}