[백준 3005] 크로스워드 퍼즐 쳐다보기 - JAVA

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

 

위/왼쪽이 배열의 끝이거나 #이면, 아래/오른쪽으로 탐색

정렬후 top 출력

 

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.List;
import java.util.StringTokenizer;

class Main {

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

    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    StringTokenizer st = new StringTokenizer(br.readLine());
    int R = Integer.parseInt(st.nextToken());
    int C = Integer.parseInt(st.nextToken());

    List<String> dic = new ArrayList<>();
    char[][] a = new char[R][C];

    for (int i = 0; i < R; i++) {
      String s = br.readLine();
      for (int j = 0; j < C; j++) {
        a[i][j] = s.charAt(j);
      }
    }
    for (int i = 0; i < R; i++) {
      for (int j = 0; j < C; j++) {

        if (i == 0 || a[i - 1][j] == '#') {

          int n = i;
          StringBuilder sb = new StringBuilder();
          while (n < R && a[n][j] != '#') {
            sb.append(a[n][j]);
            n++;
          }
          if (sb.length() > 1) {
            dic.add(sb.toString());
          }
        }

        if (j == 0 || a[i][j - 1] == '#') {
          int n = j;
          StringBuilder sb = new StringBuilder();
          while (n < C && a[i][n] != '#') {
            sb.append(a[i][n]);
            n++;
          }
          if (sb.length() > 1) {
            dic.add(sb.toString());
          }
        }
      }
    }

    System.out.println(dic.stream().sorted().limit(1).findFirst().get());
  }
}