-
Notifications
You must be signed in to change notification settings - Fork 5
/
TwoDArrayDs.java
42 lines (35 loc) · 1.33 KB
/
TwoDArrayDs.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
// https://www.hackerrank.com/challenges/2d-array/problem
package arrays;
import java.util.Scanner;
public class TwoDArrayDs {
private static final Scanner SCANNER = new Scanner(System.in);
public static void main(String[] args) {
int[][] grid = getGrid();
System.out.println(maximumHourGlassSum(grid));
}
private static int[][] getGrid() {
int[][] grid = new int[6][6];
for (int row = 0 ; row < grid.length ; row++) {
for (int column = 0 ; column < grid[row].length ; column++) {
grid[row][column] = SCANNER.nextInt();
}
}
return grid;
}
private static int maximumHourGlassSum(int[][] grid) {
int maximumHourglassSum = Integer.MIN_VALUE;
for (int row = 0 ; row < grid.length - 2 ; row++) {
for (int column = 0 ; column < grid[row].length - 2 ; column++) {
maximumHourglassSum = Math.max(maximumHourglassSum, hourGlassSum(grid, row, column));
}
}
return maximumHourglassSum;
}
private static int hourGlassSum(int[][] grid, int row, int column) {
int sum = 0;
for (int index = column ; index < column + 3 ; index++) {
sum += grid[row][index] + grid[row + 2][index];
}
return sum + grid[row + 1][column + 1];
}
}