[프로그래머스][JAVA] [1차] 비밀지도 (문자열)

class Solution {
    public String[] solution(int n, int[] arr1, int[] arr2) {
        String[] answer = new String[n];
        for(int i=0; i<n; i++){
            // System.out.println(Integer.toBinaryString(arr1[i]|arr2[i]));
            answer[i] = String.format("%" + n + "s", Integer.toBinaryString(arr1[i]|arr2[i]))
                            .replaceAll("1","#")
                            .replaceAll("0"," ");
            
        }
 
        
        
        return answer;
    }
}