컬러링북

import java.nio.channels.Pipe;
import java.util.LinkedList;
import java.util.Queue;


public class ColoringBook {
        static int m =6;
        static int n =4;
        static int [][] picture = {
                {1,1,1,0},
                {1,2,2,0},
                {1,0,0,1},
                {0,0,0,1},
                {0,0,0,3},
                {0,0,0,3}
        };

    static int [] dx = {1,-1,0,0};
    static int [] dy = {0,0,1,-1};
    static boolean[][] visited;


    public static void main(String[] args) {
        visited = new boolean[m][n];
        int numberOfArea =0; //영역 개수
        int maxSizeOfOneArea=0; //가장 큰 영역

        for(int i =0; i<m; i++){
            for(int j=0; j<n; j++){
                if(picture[i][j] !=0 && !visited[i][j]){
                    maxSizeOfOneArea = Math.max(maxSizeOfOneArea, bfs(m,n,i,j,picture));
                    numberOfArea++;
                }
            }
        }
        System.out.println(numberOfArea + "  " +maxSizeOfOneArea);
    }

    public static int bfs(int m, int n, int x, int y, int[][]picture){
       int range = 1;
       int target = picture[x][y];
       Queue<Point> q = new LinkedList<>();

       visited[x][y] = true;
       q.offer(new Point(x,y));

       while(!q.isEmpty()) {
           Point p = q.poll();

           for (int i = 0; i < 4; i++) {
               int nx = p.x + dx[i];
               int ny = p.y + dy[i];

               if (nx >= 0 && nx < m && ny >= 0 && ny < n && picture[nx][ny] == target && !visited[nx][ny]) {
                   q.offer(new Point(nx, ny));
                   visited[nx][ny] = true;
                   range++;
               }
           }
       }
        return range;
    }
}

class Point{
    int x;
    int y;

    Point(int x, int y) {
        this.x = x;
        this.y = y;
    }
}