Question: need help please Context Given a 6 6 2D Array. A: 1110 1110 We define an hourglass in A to be a subset of values




need help please
Context Given a 6 6 2D Array. A: 1110 1110 We define an hourglass in A to be a subset of values with indices falling in this pattern in A's graphical representation a b c e f g There are 16 hourglasses in A, and an hourglass sum is the sum of an hourglass' values Task Calculate the hourglass sum for every hourglass in A, then print the maximum hourglass sum Note: If you have already solved the Java domain's Java 2D Array challenge, you may wish to skip this challenge Input Format There are 6 lines of input, where each line contains 6 space-separated integers describing 2D Array A; every value in A will be in the inclusive range of -9 to 9
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
