[프로그래머스] 쿼드압축 후 개수 세기

 

 

[문제]

https://school.programmers.co.kr/learn/courses/30/lessons/68936#qna

프로그래머스

 

 

[소스 코드]

class Solution {
    int[] answer = new int[2];
    public int[] solution(int[][] arr) {
        recursion(arr);
        return answer;
    }
    void recursion(int[][] arr){
        int num = getNum(arr);
        if(num>=0){
            answer[num]++;
            return;
        }
        int size = arr.length;
        recursion(copy(arr,0,0));
        recursion(copy(arr,size/2,0));
        recursion(copy(arr,0,size/2));
        recursion(copy(arr,size/2,size/2));
    }
    int[][] copy(int[][] arr,int sr,int sc){
        int size = arr.length / 2;
        int[][] copyArr = new int[size][size];
        for(int i=0;i<size;i++){
            for(int j=0;j<size;j++){
                copyArr[i][j] = arr[i+sr][j+sc];
            }
        }
        return copyArr;
    }
    int getNum(int[][] arr){
        int num = arr[0][0];
        for(int i=0;i<arr.length;i++){
            for(int j=0;j<arr.length;j++){
                if(arr[i][j]!=num) return -1;
            }
        }
        return num;
    }
}