자기개발👨‍💻/코딩 알고리즘

[python] 2018 카카오 비밀지도

천숭이 2021. 1. 5. 21:00
def solution(n, arr1, arr2):
    answer=[]
    for i in range(n):
        board=""
        tmp1=list(str(bin(arr1[i])))
        tmp1[1]='0'
        tmp1=["0"]*n+tmp1
        tmp1=tmp1[-n:]
        tmp2=list(str(bin(arr2[i])))
        tmp2[1]='0'
        tmp2=["0"]*n+tmp2
        tmp2=tmp2[-n:]
        
        for j in range(n):
            if tmp1[j]=="1" or tmp2[j]=="1":
                board+="#"
            else: board+=" "
        answer.append(board)
    
    return answer