Java Day 11: 2D Arrays
Given a 6x6 2D Array, A:
Calculate the hourglass sum for every hourglass in A, then print the maximum hourglass sum.
- import java.io.*;
- import java.math.*;
- import java.security.*;
- import java.text.*;
- import java.util.*;
- import java.util.concurrent.*;
- import java.util.regex.*;
-
- public class Solution {
- public static void main(String[] args) {
- Scanner in = new Scanner(System.in);
- int arr[][] = new int[6][6];
- for (int i = 0; i < 6; i++) {
- for (int j = 0; j < 6; j++) {
- arr[i][j] = in.nextInt();
- }
- }
-
- int max = -9 * 7;
- for (int i = 0; i < 6; i++) {
- for (int j = 0; j < 6; j++) {
- if (j + 2 < 6 && i + 2 < 6) {
- int sum = arr[i][j] + arr[i][j + 1] + arr[i][j + 2] + arr[i + 1][j + 1] + arr[i + 2][j] + arr[i + 2][j + 1] + arr[i + 2][j + 2];
- if (sum > max) max = sum;
- }
- }
- }
-
- System.out.println(max);
- }
- }