[알고리즘] 비밀지도

문제

https://programmers.co.kr/learn/courses/30/lessons/17681

풀이

function solution(n, arr1, arr2) {
    function addZero(str){
        let zero = "";
        if (str.length < n) {
            for (let i = str.length; i < n; i++)
            zero += '0';
        }
        return zero+str;
    }
    const bin = arr1.map(element => {return addZero(element.toString(2))});
    const bin2 = arr2.map(element => {return addZero(element.toString(2))});
    const map = [];
    for(let j = 0; j<n;j++){
        let row = "";
        for(let k = 0; k<n;k++){
            if(bin[j][k] === "1" || bin2[j][k] === "1"){
                row += "#";
            } else{
                row += " ";
            }
    }
    map.push(row);
    }   
    return map;
}