-
Notifications
You must be signed in to change notification settings - Fork 0
/
Day11_2D Arrays
62 lines (46 loc) · 1.88 KB
/
Day11_2D Arrays
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
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.function.*;
import java.util.regex.*;
import java.util.stream.*;
import static java.util.stream.Collectors.joining;
import static java.util.stream.Collectors.toList;
public class Solution {
public static void main(String[] args) throws IOException {
BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));
List<List<Integer>> arr = new ArrayList<>();
IntStream.range(0, 6).forEach(i -> {
try {
arr.add(
Stream.of(bufferedReader.readLine().replaceAll("\\s+$", "").split(" "))
.map(Integer::parseInt)
.collect(toList())
);
} catch (IOException ex) {
throw new RuntimeException(ex);
}
});
int sum=0,maxv=Integer.MIN_VALUE,maxval=0;
int numRows = arr.size();
for(int j=0;j<=numRows-3;j++)
{
for(int k=0;k<=arr.get(j).size()-3;k++)
{
sum=(arr.get(j).get(k) + arr.get(j).get(k+1) + arr.get(j).get(k+2))
+ (arr.get(j+1).get(k+1)) +
(arr.get(j+2).get(k) + arr.get(j+2).get(k+1) + arr.get(j+2).get(k+2));
maxv=Math.max(sum, maxv);
// if(sum>maxval)
// {
// maxval=sum;
// }
}
}
System.out.print(maxv);
bufferedReader.close();
}
}