【HackerRank】 有洞的地图

 1 import java.io.*;
 2 import java.util.*;
 3 import java.text.*;
 4 import java.math.*;
 5 import java.util.regex.*;
 6 
 7 public class Solution {
 8     public static void main(String[] args) {
 9         Scanner in = new Scanner(System.in);
10         int n = in.nextInt();
11         int[][] ar = new int[n][n];
12         for(int i = 0;i < n;i++){
13             String temp = in.next();
14             for(int j = 0;j < n;j++)
15                 ar[i][j] = temp.charAt(j) - ‘0‘; 
16         }
17         
18         for(int i = 0;i < n;i++){
19             StringBuffer sb = new StringBuffer();
20             for(int j = 0;j < n;j++){
21                 boolean isHole = true;
22                 //up
23                 if(i-1<0||i+1>=n||j-1<0||j+1>=n)
24                     isHole = false;
25                 else{
26                     if(ar[i-1][j] >= ar[i][j])
27                         isHole = false;
28                     if(ar[i+1][j] >= ar[i][j])
29                         isHole = false;
30                     if(ar[i][j-1] >= ar[i][j])
31                         isHole = false;
32                     if(ar[i][j+1] >= ar[i][j])
33                         isHole = false;
34                 }
35                 
36                 if(isHole)
37                     sb.append(‘X‘);
38                 else {
39                     sb.append(ar[i][j]); 
40                 }
41             }
42             System.out.println(sb.toString());
43         }
44       }
45 }