[프로그래머스] 1차 비밀지도

문제링크

bin 함수 공부 해보기!

파이썬

def solution(n, arr1, arr2):
    answer = []
    arr1_bin = []
    arr2_bin = []
    for i in range(n):
        arr1_bin.append(bin(arr1[i])[2:])
        arr2_bin.append(bin(arr2[i])[2:])
        arr1_bin[i] = ('0'*(n-len(arr1_bin[i]))) + arr1_bin[i]
        arr2_bin[i] = ('0'*(n-len(arr2_bin[i]))) + arr2_bin[i]
        tmp = ''
        for j in range(n):
            if arr1_bin[i][j] == '1' or arr2_bin[i][j] =='1':
                tmp += '#'
            elif arr1_bin[i][j] == '0' and arr2_bin[i][j] == '0':
                tmp += ' '
        answer.append(tmp)
    return answer