LV. 1 :: [1차] 비밀지도

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

프로그래머스

 

function solution(n, arr1, arr2) 
{
    var answer = [];
    var newarr1 =[];
    var newarr2 =[];
    var tempsharp = '';
    
    for(i=0; i<n; i++)
    {
        newarr1.push(arr1[i].toString(2));
        newarr2.push(arr2[i].toString(2));
    }
    
    // newarr1 = ["1001","10100","11100","10010","1011"]
    // newarr2 = ["11110","1","10101","10001","11100"]
    
// --------------------------------------------------------------------------
    
    for(i=0; i<n; i++)
    {
        newarr1.splice(i, 1, "0000000000000000"+newarr1[i]);
        newarr2.splice(i, 1, "0000000000000000"+newarr2[i]);
    }
    // newarr1 = ["00000000000000001001","000000000000000010100","000000000000000011100","000000000000000010010","00000000000000001011"]
    // newarr2 = ["000000000000000011110","00000000000000001","000000000000000010101","000000000000000010001","000000000000000011100"]
    
    
    for(i=0; i<n; i++)
    {
        newarr1.splice(i, 1, newarr1[i].slice(newarr1[i].length-n, newarr1[i].length));
        newarr2.splice(i, 1, newarr2[i].slice(newarr2[i].length-n, newarr2[i].length));
    }

    // newarr1 = ["01001","10100","11100","10010","01011"]
    // newarr2 = ["11110","00001","10101","10001","11100"]
    
// --------------------------------------------------------------------------
    
    for (i=0; i<n; i++)
    {
        for (j=0; j<n; j++)
        {
            if( (newarr1[i][j]==1) || (newarr2[i][j]==1) ) 
            {
                tempsharp += '#';
            }
            else
            {
                tempsharp += ' ';
            }
            
        }
        answer.push(tempsharp);
        tempsharp = '';
    }
    
    
    
    return answer;
}