자료구조 & 알고리즘/프로그래머스
Level 2. 행렬의 곱셈
diesuki4
2023. 3. 29. 07:43
Level 2. 행렬의 곱셈
#include <iostream>
#include <vector>
using namespace std;
vector<vector<int>> solution(vector<vector<int>> arr1, vector<vector<int>> arr2)
{
size_t M = arr1.size(), K = arr2.size(), N = arr2.front().size();
vector<vector<int>> answer(M, vector<int>(N, 0));
for (int row = 0; row < M; ++row)
for (int col = 0; col < N; ++col)
for (int i = 0; i < K; ++i)
answer[row][col] += arr1[row][i] * arr2[i][col];
return answer;
}