-
Notifications
You must be signed in to change notification settings - Fork 858
/
TwoDArrayDS.java
46 lines (39 loc) · 1010 Bytes
/
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
43
44
45
46
/**
*
* Problem Statement-
* [2D Array - DS](https://www.hackerrank.com/challenges/2d-array)
*
*/
package com.javaaid.hackerrank.solutions.datastructures.arrays;
import java.util.Scanner;
/**
*
* @author Kanahaiya Gupta
*
*/
public class TwoDArrayDS {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int arr[][] = new int[6][6];
for (int arr_i = 0; arr_i < 6; arr_i++) {
for (int arr_j = 0; arr_j < 6; arr_j++) {
arr[arr_i][arr_j] = in.nextInt();
}
}
int maxsum = Integer.MIN_VALUE;
for (int arr_i = 0; arr_i < 6; arr_i++) {
for (int arr_j = 0; arr_j < 6; arr_j++) {
if ((arr_j + 2) < 6 && (arr_i + 2) < 6) {
int sum = arr[arr_i][arr_j] + arr[arr_i][arr_j + 1] + arr[arr_i][arr_j + 2]
+ arr[arr_i + 1][arr_j + 1] + arr[arr_i + 2][arr_j] + arr[arr_i + 2][arr_j + 1]
+ arr[arr_i + 2][arr_j + 2];
if (sum > maxsum) {
maxsum = sum;
}
}
}
}
System.out.println(maxsum);
in.close();
}
}