HackerRank/Java/DataStructures/2DArray/src/Solution.java at master · giokeyboard/HackerRank · GitHub

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
importjava.util.Scanner;

publicclassSolution {


privatestaticfinalScannerscanner = newScanner(System.in);

publicstaticvoidmain(String[] args) {
int[][] arr = newint[6][6];

for (inti = 0; i < 6; i++) {
String[] arrRowItems = scanner.nextLine().split(" ");
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");

for (intj = 0; j < 6; j++) {
intarrItem = Integer.parseInt(arrRowItems[j]);
arr[i][j] = arrItem;
 }
 }

scanner.close();
System.out.println(findMaxHourglassSum(arr));
 }

privatestaticintfindMaxHourglassSum(int[][] arr) {
intmax = Integer.MIN_VALUE;
for (inti = 0; i < arr.length; i++) {
for (intj = 0; j < arr[i].length; j++) {
if (i > 1 && j > 1) {
intsum = arr[i - 2][j - 2] + arr[i - 2][j - 1] + arr[i - 2][j] +
arr[i - 1][j - 1] +
arr[i][j - 2] + arr[i][j - 1] + arr[i][j];
max = Math.max(max, sum);
 }
 }
 }
returnmax;
 }
}
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
importjava.util.Scanner;

publicclassSolution {


privatestaticfinalScannerscanner = newScanner(System.in);

publicstaticvoidmain(String[] args) {
int[][] arr = newint[6][6];

for (inti = 0; i < 6; i++) {
String[] arrRowItems = scanner.nextLine().split(" ");
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");

for (intj = 0; j < 6; j++) {
intarrItem = Integer.parseInt(arrRowItems[j]);
arr[i][j] = arrItem;
 }
 }

scanner.close();
System.out.println(findMaxHourglassSum(arr));
 }

privatestaticintfindMaxHourglassSum(int[][] arr) {
intmax = Integer.MIN_VALUE;
for (inti = 0; i < arr.length; i++) {
for (intj = 0; j < arr[i].length; j++) {
if (i > 1 && j > 1) {
intsum = arr[i - 2][j - 2] + arr[i - 2][j - 1] + arr[i - 2][j] +
arr[i - 1][j - 1] +
arr[i][j - 2] + arr[i][j - 1] + arr[i][j];
max = Math.max(max, sum);
 }
 }
 }
returnmax;
 }
}
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
importjava.util.Scanner;

publicclassSolution {


privatestaticfinalScannerscanner = newScanner(System.in);

publicstaticvoidmain(String[] args) {
int[][] arr = newint[6][6];

for (inti = 0; i < 6; i++) {
String[] arrRowItems = scanner.nextLine().split(" ");
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");

for (intj = 0; j < 6; j++) {
intarrItem = Integer.parseInt(arrRowItems[j]);
arr[i][j] = arrItem;
 }
 }

scanner.close();
System.out.println(findMaxHourglassSum(arr));
 }

privatestaticintfindMaxHourglassSum(int[][] arr) {
intmax = Integer.MIN_VALUE;
for (inti = 0; i < arr.length; i++) {
for (intj = 0; j < arr[i].length; j++) {
if (i > 1 && j > 1) {
intsum = arr[i - 2][j - 2] + arr[i - 2][j - 1] + arr[i - 2][j] +
arr[i - 1][j - 1] +
arr[i][j - 2] + arr[i][j - 1] + arr[i][j];
max = Math.max(max, sum);
 }
 }
 }
returnmax;
 }
}
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
importjava.util.Scanner;

publicclassSolution {


privatestaticfinalScannerscanner = newScanner(System.in);

publicstaticvoidmain(String[] args) {
int[][] arr = newint[6][6];

for (inti = 0; i < 6; i++) {
String[] arrRowItems = scanner.nextLine().split(" ");
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");

for (intj = 0; j < 6; j++) {
intarrItem = Integer.parseInt(arrRowItems[j]);
arr[i][j] = arrItem;
 }
 }

scanner.close();
System.out.println(findMaxHourglassSum(arr));
 }

privatestaticintfindMaxHourglassSum(int[][] arr) {
intmax = Integer.MIN_VALUE;
for (inti = 0; i < arr.length; i++) {
for (intj = 0; j < arr[i].length; j++) {
if (i > 1 && j > 1) {
intsum = arr[i - 2][j - 2] + arr[i - 2][j - 1] + arr[i - 2][j] +
arr[i - 1][j - 1] +
arr[i][j - 2] + arr[i][j - 1] + arr[i][j];
max = Math.max(max, sum);
 }
 }
 }
returnmax;
 }
}
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
importjava.util.Scanner;

publicclassSolution {


privatestaticfinalScannerscanner = newScanner(System.in);

publicstaticvoidmain(String[] args) {
int[][] arr = newint[6][6];

for (inti = 0; i < 6; i++) {
String[] arrRowItems = scanner.nextLine().split(" ");
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");

for (intj = 0; j < 6; j++) {
intarrItem = Integer.parseInt(arrRowItems[j]);
arr[i][j] = arrItem;
 }
 }

scanner.close();
System.out.println(findMaxHourglassSum(arr));
 }

privatestaticintfindMaxHourglassSum(int[][] arr) {
intmax = Integer.MIN_VALUE;
for (inti = 0; i < arr.length; i++) {
for (intj = 0; j < arr[i].length; j++) {
if (i > 1 && j > 1) {
intsum = arr[i - 2][j - 2] + arr[i - 2][j - 1] + arr[i - 2][j] +
arr[i - 1][j - 1] +
arr[i][j - 2] + arr[i][j - 1] + arr[i][j];
max = Math.max(max, sum);
 }
 }
 }
returnmax;
 }
}
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
importjava.util.Scanner;

publicclassSolution {


privatestaticfinalScannerscanner = newScanner(System.in);

publicstaticvoidmain(String[] args) {
int[][] arr = newint[6][6];

for (inti = 0; i < 6; i++) {
String[] arrRowItems = scanner.nextLine().split(" ");
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");

for (intj = 0; j < 6; j++) {
intarrItem = Integer.parseInt(arrRowItems[j]);
arr[i][j] = arrItem;
 }
 }

scanner.close();
System.out.println(findMaxHourglassSum(arr));
 }

privatestaticintfindMaxHourglassSum(int[][] arr) {
intmax = Integer.MIN_VALUE;
for (inti = 0; i < arr.length; i++) {
for (intj = 0; j < arr[i].length; j++) {
if (i > 1 && j > 1) {
intsum = arr[i - 2][j - 2] + arr[i - 2][j - 1] + arr[i - 2][j] +
arr[i - 1][j - 1] +
arr[i][j - 2] + arr[i][j - 1] + arr[i][j];
max = Math.max(max, sum);
 }
 }
 }
returnmax;
 }
}
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
importjava.util.Scanner;

publicclassSolution {


privatestaticfinalScannerscanner = newScanner(System.in);

publicstaticvoidmain(String[] args) {
int[][] arr = newint[6][6];

for (inti = 0; i < 6; i++) {
String[] arrRowItems = scanner.nextLine().split(" ");
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");

for (intj = 0; j < 6; j++) {
intarrItem = Integer.parseInt(arrRowItems[j]);
arr[i][j] = arrItem;
 }
 }

scanner.close();
System.out.println(findMaxHourglassSum(arr));
 }

privatestaticintfindMaxHourglassSum(int[][] arr) {
intmax = Integer.MIN_VALUE;
for (inti = 0; i < arr.length; i++) {
for (intj = 0; j < arr[i].length; j++) {
if (i > 1 && j > 1) {
intsum = arr[i - 2][j - 2] + arr[i - 2][j - 1] + arr[i - 2][j] +
arr[i - 1][j - 1] +
arr[i][j - 2] + arr[i][j - 1] + arr[i][j];
max = Math.max(max, sum);
 }
 }
 }
returnmax;
 }
}
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
importjava.util.Scanner;

publicclassSolution {


privatestaticfinalScannerscanner = newScanner(System.in);

publicstaticvoidmain(String[] args) {
int[][] arr = newint[6][6];

for (inti = 0; i < 6; i++) {
String[] arrRowItems = scanner.nextLine().split(" ");
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");

for (intj = 0; j < 6; j++) {
intarrItem = Integer.parseInt(arrRowItems[j]);
arr[i][j] = arrItem;
 }
 }

scanner.close();
System.out.println(findMaxHourglassSum(arr));
 }

privatestaticintfindMaxHourglassSum(int[][] arr) {
intmax = Integer.MIN_VALUE;
for (inti = 0; i < arr.length; i++) {
for (intj = 0; j < arr[i].length; j++) {
if (i > 1 && j > 1) {
intsum = arr[i - 2][j - 2] + arr[i - 2][j - 1] + arr[i - 2][j] +
arr[i - 1][j - 1] +
arr[i][j - 2] + arr[i][j - 1] + arr[i][j];
max = Math.max(max, sum);
 }
 }
 }
returnmax;
 }
}