Level 1 행렬의 덧셈

시간 복잡도: O(N*M)

1#include <string>
2#include <vector>
3using namespace std;
4
5vector<vector<int>> solution(vector<vector<int>> arr1, vector<vector<int>> arr2) {
6  vector<vector<int>> answer;
7
8  const int SIZE = arr1.size();
9
10  for(int i=0; i<SIZE; ++i) {
11    vector<int> temp;
12    const int vSize = arr1[i].size();
13    for(int j=0; j<vSize; ++j) {
14      int x = arr1[i][j] + arr2[i][j];
15      temp.push_back(x);
16    }
17    answer.push_back(temp);
18  }
19  return answer;
20}