프로젝트 오일러 문제 11 : 수평, 수직, 또는 대각선 방향으로 연속된 숫자 네 개의 곱 중 최댓값은 얼마입니까?

안녕하세요 알통몬입니다. 공감 및 댓글은 포스팅 하는데 아주아주 큰 힘이 됩니다!! 포스팅 내용이 찾아주신 분들께 도움이 되길 바라며 더 깔끔하고 좋은 포스팅을 만들어 나가겠습니다^^

public class Question { public static void main(String[] args) { int[][] num = {  { 8, 2, 22, 97, 38, 15, 0, 40, 0, 75, 4, 5, 7, 78, 52, 12, 50, 77, 91, 8 }, { 49, 49, 99, 40, 17, 81, 18, 57, 60, 87, 17, 40, 98, 43, 69, 48, 4, 56, 62, 0 }, { 81, 49, 31, 73, 55, 79, 14, 29, 93, 71, 40, 67, 53, 88, 30, 3, 49, 13, 36, 65 }, { 52, 70, 95, 23, 4, 60, 11, 42, 69, 24, 68, 56, 1, 32, 56, 71, 37, 2, 36, 91 }, { 22, 31, 16, 71, 51, 67, 63, 89, 41, 92, 36, 54, 22, 40, 40, 28, 66, 33, 13, 80 }, { 24, 47, 32, 60, 99, 3, 45, 2, 44, 75, 33, 53, 78, 36, 84, 20, 35, 17, 12, 50 }, { 32, 98, 81, 28, 64, 23, 67, 10, 26, 38, 40, 67, 59, 54, 70, 66, 18, 38, 64, 70 }, { 67, 26, 20, 68, 2, 62, 12, 20, 95, 63, 94, 39, 63, 8, 40, 91, 66, 49, 94, 21 }, { 24, 55, 58, 5, 66, 73, 99, 26, 97, 17, 78, 78, 96, 83, 14, 88, 34, 89, 63, 72 }, { 21, 36, 23, 9, 75, 0, 76, 44, 20, 45, 35, 14, 0, 61, 33, 97, 34, 31, 33, 95 }, { 78, 17, 53, 28, 22, 75, 31, 67, 15, 94, 3, 80, 4, 62, 16, 14, 9, 53, 56, 92 }, { 16, 39, 5, 42, 96, 35, 31, 47, 55, 58, 88, 24, 0, 17, 54, 24, 36, 29, 85, 57 }, { 86, 56, 0, 48, 35, 71, 89, 7, 5, 44, 44, 37, 44, 60, 21, 58, 51, 54, 17, 58 }, { 19, 80, 81, 68, 5, 94, 47, 69, 28, 73, 92, 13, 86, 52, 17, 77, 4, 89, 55, 40 }, { 4, 52, 8, 83, 97, 35, 99, 16, 7, 97, 57, 32, 16, 26, 26, 79, 33, 27, 98, 66 }, { 88, 36, 68, 87, 57, 62, 20, 72, 3, 46, 33, 67, 46, 55, 12, 32, 63, 93, 53, 69 }, { 4, 42, 16, 73, 38, 25, 39, 11, 24, 94, 72, 18, 8, 46, 29, 32, 40, 62, 76, 36 }, { 20, 69, 36, 41, 72, 30, 23, 88, 34, 62, 99, 69, 82, 67, 59, 85, 74, 4, 36, 16 }, { 20, 73, 35, 29, 78, 31, 90, 1, 74, 31, 49, 71, 48, 86, 81, 16, 23, 57, 5, 54 }, { 1, 70, 54, 71, 83, 51, 54, 69, 16, 92, 33, 48, 61, 43, 52, 1, 89, 19, 67, 48 }  }; int garoGop = 1; int garoMax = 0; // 수평 for (int a = 0; a < 20; a++) { for (int b = 0; b < 17; b++) { garoGop = 1; for (int i = 0; i < 4; i++) { garoGop *= num[a][b + i]; } if (garoMax < garoGop) { garoMax = garoGop; } } } int seroGop = 1; int seroMax = 0; // 수직 for (int a = 0; a < 17; a++) { for (int b = 0; b < 20; b++) { seroGop = 1; for (int j = 0; j < 4; j++) { seroGop *= num[a + j][b]; } if (seroMax < seroGop) { seroMax = seroGop; } } } int diaGop = 1; int diaMax = 0; //   ＼대각선 for (int a = 0; a < 17; a++) { for (int b = 0; b < 17; b++) { diaGop = 1; for (int j = 0; j < 4; j++) { diaGop *= num[a + j][b + j]; } if (diaMax < diaGop) { diaMax = diaGop; } } } int diaGop2 = 1; int diaMax2 = 0; // /대각선 for (int a = 19; a > 2; a--) { for (int b = 0; b < 17; b++) { diaGop2 = 1; for (int j = 0; j < 4; j++) { diaGop2 *= num[a - j][b + j]; } if (diaMax2 < diaGop2) { diaMax2 = diaGop2; } } } System.out.println(garoMax + "  " + seroMax + "  " + diaMax + "  " + diaMax2); }   }