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

• 문제 & 예시
  

• 소스코드

class Solution {
    public String[] solution(int n, int[] arr1, int[] arr2) {
        String[] answer = new String[n];
        Long[] copy1 = new Long[n];
        Long[] copy2 = new Long[n];
        
        for (int i = 0; i < n; i++) {
            copy1[i] = Long.parseLong(Long.toBinaryString(arr1[i]));
            copy2[i] = Long.parseLong(Long.toBinaryString(arr2[i]));
            answer[i] = String.format("%0" + n + "d", copy1[i] + copy2[i]);
            answer[i] = answer[i].replaceAll("[^0]", "#");
            answer[i] = answer[i].replace("0", " ");
        } 
        return answer;
    }
}

• consol