You are viewing a single comment's thread. Return to all comments →
I did something similar, but without the sum array.
int max = Integer.MIN_VALUE; for(int i=0; i+2 < arr.length; i++) { for(int j=0; j+2 < arr[0].length; j++) { int 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][down+2]; max = Math.max(sum,max); } } System.out.println(max);
Seems like cookies are disabled on this browser, please enable them to open this website
Day 11: 2D Arrays
You are viewing a single comment's thread. Return to all comments →
I did something similar, but without the sum array.