3242. Design Neighbor Sum Service
Easy
10 Points
Array
Hash Table
Design
Matrix
Simulation
You are given a n x n 2D array grid containing distinct elements in the range [0, n2 - 1].
Implement the NeighborSum class:
Examples
Example 1
Input:
["NeighborSum", "adjacentSum", "adjacentSum", "diagonalSum", "diagonalSum"]
[[[[0, 1, 2], [3, 4, 5], [6, 7, 8]]], [1], [4], [4], [8]]
Output: [null, 6, 16, 16, 4]
Explanation:
Example 2
Input:
["NeighborSum", "adjacentSum", "diagonalSum"]
[[[[1, 2, 0, 3], [4, 7, 15, 6], [8, 9, 10, 11], [12, 13, 14, 5]]], [15], [9]]
Output: [null, 23, 45]
Explanation:
Constraints
3 <= n == grid.length == grid[0].length <= 100 <= grid[i][j] <= n2 - 1All grid[i][j] are distinct.value in adjacentSum and diagonalSum will be in the range [0, n2 - 1].At most 2 * n2 calls will be made to adjacentSum and diagonalSum.
3242. Design Neighbor Sum Service
Easy
10 Points
Array
Hash Table
Design
Matrix
Simulation
You are given a n x n 2D array grid containing distinct elements in the range [0, n2 - 1].
Implement the NeighborSum class:
Examples
Example 1
Input:
["NeighborSum", "adjacentSum", "adjacentSum", "diagonalSum", "diagonalSum"]
[[[[0, 1, 2], [3, 4, 5], [6, 7, 8]]], [1], [4], [4], [8]]
Output: [null, 6, 16, 16, 4]
Explanation:
Example 2
Input:
["NeighborSum", "adjacentSum", "diagonalSum"]
[[[[1, 2, 0, 3], [4, 7, 15, 6], [8, 9, 10, 11], [12, 13, 14, 5]]], [15], [9]]
Output: [null, 23, 45]
Explanation:
Constraints
3 <= n == grid.length == grid[0].length <= 100 <= grid[i][j] <= n2 - 1All grid[i][j] are distinct.value in adjacentSum and diagonalSum will be in the range [0, n2 - 1].At most 2 * n2 calls will be made to adjacentSum and diagonalSum.