在N×M矩阵中，找出最大邻域数等于它们在最佳时间内的邻域数

function findMaxNeighborhood(matrix) {
  let maxNeighborhood = 0;

  for (let i = 0; i < matrix.length; i++) {
    for (let j = 0; j < matrix[i].length; j++) {
      let currentNeighborhood = 0;

      // Check top neighbor
      if (i > 0) {
        currentNeighborhood += matrix[i - 1][j];
      }

      // Check bottom neighbor
      if (i < matrix.length - 1) {
        currentNeighborhood += matrix[i + 1][j];
      }

      // Check left neighbor
      if (j > 0) {
        currentNeighborhood += matrix[i][j - 1];
      }

      // Check right neighbor
      if (j < matrix[i].length - 1) {
        currentNeighborhood += matrix[i][j + 1];
      }

      // Check top-left neighbor
      if (i > 0 && j > 0) {
        currentNeighborhood += matrix[i - 1][j - 1];
      }

      // Check top-right neighbor
      if (i > 0 && j < matrix[i].length - 1) {
        currentNeighborhood += matrix[i - 1][j + 1];
      }

      // Check bottom-left neighbor
      if (i < matrix.length - 1 && j > 0) {
        currentNeighborhood += matrix[i + 1][j - 1];
      }

      // Check bottom-right neighbor
      if (i < matrix.length - 1 && j < matrix[i].length - 1) {
        currentNeighborhood += matrix[i + 1][j + 1];
      }

      if (currentNeighborhood > maxNeighborhood) {
        maxNeighborhood = currentNeighborhood;
      }
    }
  }

  return maxNeighborhood;
}

// 示例用法
const matrix = [
  [1, 2, 3],
  [4, 5, 6],
  [7, 8, 9]
];

const maxNeighborhood = findMaxNeighborhood(matrix);
console.log("最大邻域数:", maxNeighborhood);