곱셈1 [Lv.2]행렬의 곱셈 package Lv_2; public class 행렬의곱셈 { public static int[][] solution(int[][] arr1, int[][] arr2) { int[][] answer = new int[arr1.length][arr2[0].length]; for (int i = 0; i < arr1.length; i++) { for (int j = 0; j < arr2[0].length; j++) { for (int k = 0; k < arr2.length; k++) { answer[i][j] += arr1[i][k] * arr2[k][j]; } } } return answer; } public static void main(String[] args) { int[][] arr1 = new .. 2023. 2. 12. 이전 1 다음
