인프런 커뮤니티 질문&답변

const solution2 = (arr, count = 0) => {
  for (let i = 0; i < arr.length; i++) {
    for (let j = 0; j < arr.length; j++) {
      const isTop = i === 0;
      const isBottom = i === arr.length - 1;
      const isLeft = j === 0;
      const isRight = j === arr.length - 1;
      const current = arr[i][j];

      (isTop || arr[i - 1][j] < current) &&
        (isBottom || arr[i + 1][j] < current) &&
        (isLeft || arr[i][j - 1] < current) &&
        (isRight || arr[i][j + 1] < current) &&
        count++;
    }
  }
  return count;
};