[프로그래머스] 2018 KAKAO BLIND RECRUITMENT [1차] 비밀지도

def solution(n, arr1, arr2):
    answer = []
    binaryarr1 = []
    binaryarr2 = []
    binary_result = ''
    
    for i in range(len(arr1)): 
        binaryNum1 = format(arr1[i], 'b')
        binaryNum2 = format(arr2[i], 'b')
        if len(binaryNum1) < n:
            binaryNum1 = ('0'*(n-len(binaryNum1))) + binaryNum1
        if len(binaryNum2) < n:
            binaryNum2 = ('0'*(n-len(binaryNum2))) + binaryNum2
        binaryarr1.append(binaryNum1)
        binaryarr2.append(binaryNum2)
        
    for i in range(len(binaryarr1)):
        for j in range(n):
            if binaryarr1[i][j] == '0' and binaryarr2[i][j] == '0':
                binary_result = binary_result + (' ')
            else:
                binary_result = binary_result + ('#')
        answer.append(binary_result)
        binary_result = ''
        
    return answer