_3242.java

packagecom.fishercoder.solutions.fourththousand;

importjava.util.HashMap;
importjava.util.Map;

publicclass_3242 {
publicstaticclassSolution1 {
classneighborSum {
int[][] matrix;
intm;
intn;
Map<Integer, int[]> map;

publicneighborSum(int[][] grid) {
this.matrix = grid;
this.m = grid.length;
this.n = grid[0].length;
this.map = newHashMap<>();
for (inti = 0; i < m; i++) {
for (intj = 0; j < n; j++) {
map.put(grid[i][j], newint[] {i, j});
 }
 }
 }

publicintadjacentSum(intvalue) {
int[] dirs = newint[] {0, 1, 0, -1, 0};
int[] pos = this.map.get(value);
intsum = 0;
for (inti = 0; i < dirs.length - 1; i++) {
intnextx = pos[0] + dirs[i];
intnexty = pos[1] + dirs[i + 1];
if (nextx >= 0 && nextx < m && nexty >= 0 && nexty < n) {
sum += matrix[nextx][nexty];
 }
 }
returnsum;
 }

publicintdiagonalSum(intvalue) {
int[][] dirs =
newint[][] {
 {-1, 1},
 {1, 1},
 {1, -1},
 {-1, -1}
 };
int[] pos = this.map.get(value);
intsum = 0;
for (int[] dir : dirs) {
intnextx = pos[0] + dir[0];
intnexty = pos[1] + dir[1];
if (nextx >= 0 && nextx < m && nexty >= 0 && nexty < n) {
sum += matrix[nextx][nexty];
 }
 }
returnsum;
 }
 }
 }
}