-
Notifications
You must be signed in to change notification settings - Fork 858
/
Day112DArrays.java
41 lines (37 loc) · 937 Bytes
/
Day112DArrays.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
/**
*
* Problem Statement-
* [2D Arrays](https://www.hackerrank.com/challenges/30-2d-arrays/problem)
*
*/
package com.javaaid.hackerrank.solutions.thirtydaysofcode;
import java.util.Scanner;
/**
* @author Kanahaiya Gupta
*
*/
public class Day112DArrays {
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();
}
}
in.close();
int sum = 0, maxSum = Integer.MIN_VALUE;
for (int i = 0; i < 6; i++) {
for (int j = 0; j < 6; j++) {
if ((i + 2) < 6 && (j + 2) < 6) {
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 > maxSum) {
maxSum = sum;
}
}
}
System.out.println(maxSum);
}
}