테스트 케이스 10, 20 은 맞는데 30부터오답이에요

package array;

import java.util.Arrays;
import java.util.Scanner;

public class Peaks_10 {

	static int solution(int n, int[][] arr) {
		
		int cnt = 0;
		
		for(int i=1; i <= n; i++) {
			
			for(int j = 1; j <= n; j++) {

				int target = arr[i][j];
				
				// target과 상 하 좌 우 중 큰 값을 찾는 삼항연산자.
				int up = target > arr[i-1][j] ? target : arr[i-1][j];
				int down = target > arr[i+1][j] ? target : arr[i+1][j];
				int left = target > arr[i][j-1] ? target : arr[i][j-1];
				int right = target > arr[i][j+1] ? target : arr[i][j+1];
				
				// 상 하 좌 우 모두 target일 경우 cnt 값 증가
				if(target == up && target ==down && target == left && target == right) {
					cnt++;
				}
				
			}
		}
		
		return cnt;
		
	}
	
	public static void main(String[] args) {
		
		Scanner sc = new Scanner(System.in);
		
		int n = sc.nextInt();
		
		int[][] arr = new int[n+2][n+2];
		
		for(int i = 1; i <= n; i++) {
			
			for(int j = 1; j <= n; j++) {
				
				int num = sc.nextInt();
				
				arr[i][j] = num;
				
			}
			
		}
		
		System.out.println(Peaks_10.solution(n,arr));

	}

}

import java.io.*;
import java.util.*;

public class Peaks_10 {

  static int solution(int n, int[][] arr) {

    int cnt = 0;

    for (int i = 1; i <= n; i++) {
      for (int j = 1; j <= n; j++) {
        int target = arr[i][j];

        if(target > arr[i - 1][j] && target > arr[i + 1][j] && target > arr[i][j + 1] && target > arr[i][j - 1]){
          cnt++;
        }
      }
    }

    return cnt;
  }

  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int n = sc.nextInt();

    int[][] arr = new int[n + 2][n + 2];

    for (int i = 1; i <= n; i++) {
      for (int j = 1; j <= n; j++) {
        int num = sc.nextInt();

        arr[i][j] = num;
      }
    }
    System.out.println(Peaks_10.solution(n, arr));
  }
}