프로그래머스 - 쿼드압축 후 개수 세기 (L2)

 1answer = [0, 0]
 2
 3def solution(arr):
 4    def recursion(sx, sy, k):
 5        global answer
 6        origin = arr[sy][sx]
 7        cnt = 0
 8        for i in range(sx, sx+k):
 9            for j in range(sy, sy+k):
10                if origin != arr[j][i]:
11                    recursion(sx, sy, k//2)
12                    recursion(sx+k//2, sy, k//2)
13                    recursion(sx, sy+k//2, k//2)
14                    recursion(sx+k//2, sy+k//2, k//2)
15                    return
16        answer[origin] += 1
17
18    recursion(0, 0, len(arr))
19    return answer