/*íë ¬ì ê³±ì 문ì ì¤ëª 2ì°¨ì íë ¬ arr1ê³¼ arr2를 ì ë ¥ë°ì, arr1ì arr2를 ê³±í 결과를 ë°ííë í¨ì, solutionì ìì±í´ì£¼ì¸ì. ì í ì¡°ê±´ íë ¬ arr1, arr2ì íê³¼ ì´ì 길ì´ë 2 ì´ì 100 ì´íì ëë¤. íë ¬ arr1, arr2ì ììë -10 ì´ì 20 ì´íì¸ ìì°ìì ëë¤. ê³±í ì ìë ë°°ì´ë§ 주ì´ì§ëë¤. ì ì¶ë ¥ ì arr1 arr2 return [[1, 4], [3, 2], [4, 1]] [[3, 3], [3, 3]] [[15, 15], [15, 15], [15, 15]] [[2, 3, 2], [4, 2, 4], [3, 1, 4]] [[5, 4, 3], [2, 4, 1], [3, 1, 1]] [[22, 22, 11], [36, 28, 18], [29, 20, 14]]*/ package level2; public class MatrixMul { public static void main(String[] args) { // TODO Auto-generated method stub MatrixMul mm = new MatrixMul(); int[][] arr1 = {{2,3,2}, {4,2,4}, {3,1,4}}; int[][] arr2 = {{5,4,3}, {2,4,1}, {3,1,1}}; System.out.println(mm.solution(arr1, arr2)[0][1]); } public int[][] solution(int[][] arr1, int[][] arr2) { int[][] answer = new int[arr1.length][arr2[0].length]; for(int i = 0; i < answer.length; i++) { for(int j = 0; j < answer[0].length; j++) { answer[i][j] = 0; for(int k = 0; k < arr1[0].length; k++) { answer[i][j] += arr1[i][k] * arr2[k][j]; } } } return answer; } }