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

1월 19일(금) - 5장 재귀

프로그래머스

---

public class Solution {

    private static class Count{
        public int zero;
        public int one;

        public Count(int zero, int one){
            this.zero = zero;
            this.one = one;
        }

        public Count add(Count other){
            return new Count(zero + other.zero, one + other.one);
        }
    }

    private Count count(int offset_x, int offset_y, int size, int[][] arr){
        int h = size/2;
        for(int x = offset_x; x<offset_x + size; x++)
        {
            for(int y = offset_y; y<offset_y + size; y++)
            {
                if(arr[y][x] != arr[offset_y][offset_x])
                {
                    return count(offset_x, offset_y, h, arr)
                            .add(count(offset_x+h, offset_y, h, arr))
                            .add(count(offset_x, offset_y+h, h, arr))
                            .add(count(offset_x+h, offset_y+h, h, arr));
                }
            }
        }

        if(arr[offset_y][offset_x] == 1)
        {
            return new Count(0,1);
        }
        return new Count(1,0);
    }

    public int[] solution(int[][] arr){
        Count count = count(0,0,arr.length, arr);
        return new int[] {count.zero, count.one};
    }
}

---