[백준 1996] 지뢰 찾기 - JAVA

https://www.acmicpc.net/problem/1996

 

8방 완탐 구현

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

class Main {

  public static void main(String[] args) throws IOException {

    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    int N = Integer.parseInt(br.readLine());

    int[][] m = new int[N][N];
    int[][] p = new int[N][N];
    for (int i = 0; i < N; i++) {
      String s = br.readLine();
      for (int j = 0; j < N; j++) {
        if (s.charAt(j) != '.') {
          m[i][j] = s.charAt(j) - '0';
        }
      }
    }

    int dr[] = {1, -1, 0, 0, -1, 1, -1, 1};
    int dc[] = {0, 0, -1, 1, 1, -1, -1, 1};

    for (int i = 0; i < N; i++) {
      for (int j = 0; j < N; j++) {

        int t = 0;
        for (int k = 0; k < 8; k++) {
          int tr = i + dr[k];
          int tc = j + dc[k];

          if (tr >= 0 && tr < N && tc >= 0 && tc < N) {
            t += m[tr][tc];
          }
        }
        p[i][j] = t;
      }
    }

    StringBuilder sb = new StringBuilder();
    for (int i = 0; i < N; i++) {
      for (int j = 0; j < N; j++) {
        if (m[i][j] != 0) {
          sb.append("*");
        } else {
          sb.append(p[i][j] > 9 ? "M" : p[i][j]);
        }
      }
      sb.append("\n");
    }
    System.out.println(sb);
  }
}