dybooksit / java-coding-interview Goto Github PK

 private void computeColorSpot(int i, int j, int cols, int rows, int a[][], int color) {
        a[i][j] = -a[i][j];
        currentColorSpot++;

        if (i >= 1 && a[i - 1][j] == color) { // 변경부분
            computeColorSpot(i - 1, j, cols, rows, a, color);
        }

        if ((i + 1) < rows && a[i + 1][j] == color) {
            computeColorSpot(i + 1, j, cols, rows, a, color);
        }

        if (j >= 1 && a[i][j - 1] == color) { // 변경부분
            computeColorSpot(i, j - 1, cols, rows, a, color);
        }

        if ((j + 1) < cols && a[i][j + 1] == color) {
            computeColorSpot(i, j + 1, cols, rows, a, color);
        }
    }

package coding.challenge;

import java.util.Random;

public class Main {
    public static void main(String[] args) {
        int cols = 5;
        int rows = 5;
        int color = 3; // 각 영역은 1, 2, 3번 색을 가질 수 있습니다.

        Random rnd = new Random();

        int[][] a = new int[rows][cols];

        a[0][0] = 1;
        a[0][1] = 2;
        a[0][2] = 2;
        a[0][3] = 2;
        a[0][4] = 3;

        a[1][0] = 3;
        a[1][1] = 3;
        a[1][2] = 3;
        a[1][3] = 3;
        a[1][4] = 3;

        a[2][0] = 3;
        a[2][1] = 2;
        a[2][2] = 2;
        a[2][3] = 2;
        a[2][4] = 1;

        a[3][0] = 3;
        a[3][1] = 3;
        a[3][2] = 3;
        a[3][3] = 2;
        a[3][4] = 2;

        a[4][0] = 2;
        a[4][1] = 2;
        a[4][2] = 3;
        a[4][3] = 3;
        a[4][4] = 1;

        // 화면에 영역 색 표시
        for (int i = 0; i < rows; i++) {
            for (int j = 0; j < cols; j++) {
                System.out.print(a[i][j] + "  ");
            }
            System.out.println();
        }

        BiggestColorSpots spots = new BiggestColorSpots();
        spots.determineBiggestColorSpot(cols, rows, a);
    }
}

package coding.challenge;

public class BiggestColorSpots {
    private int currentColorSpot;

    void determineBiggestColorSpot(int cols, int rows, int a[][]) {
        if (a == null) {
            throw new IllegalArgumentException("The matrix a cannot be null");
        }

        if (cols <= 0 || rows <= 0) {
            throw new IllegalArgumentException("Grid cannot have 0 rows and/or cols!");
        }

        int biggestColorSpot = 0;
        int color = 0;

        for (int i = 0; i < rows; i++) {
            for (int j = 0; j < cols; j++) {
                if (a[i][j] > 0) {
                    currentColorSpot = 0;
                    computeColorSpot(i, j, cols, rows, a, a[i][j]);

                    if (currentColorSpot > biggestColorSpot) {
                        biggestColorSpot = currentColorSpot;
                        color = a[i][j] * (-1);
                    }
                }
            }
        }
        System.out.println("\nColor: " + color + " Bigest spot: " + biggestColorSpot);
    }

    private void computeColorSpot(int i, int j, int cols, int rows, int a[][], int color) {
        a[i][j] = -a[i][j];
        currentColorSpot++;

        if (i > 1 && a[i - 1][j] == color) {
            computeColorSpot(i - 1, j, cols, rows, a, color);
        }

        if ((i + 1) < rows && a[i + 1][j] == color) {
            computeColorSpot(i + 1, j, cols, rows, a, color);
        }

        if (j > 1 && a[i][j - 1] == color) {
            computeColorSpot(i, j - 1, cols, rows, a, color);
        }

        if ((j + 1) < cols && a[i][j + 1] == color) {
            computeColorSpot(i, j + 1, cols, rows, a, color);
        }
    }
}