[카카오코테문제] 비밀지도

class Solution { 
  public String[] solution(int n, int[] arr1, int[] arr2) {
      if(n<1 || n>16){
          return null;
      }
      
      String[] answer = new String[n];
      
      for(int i=0; i<n; i++){
       
        answer[i] = Integer.toBinaryString(arr1[i] | arr2[i]);
        answer[i] = String.format("%" + n + "s", answer[i].replace("0", " "));
        answer[i] = String.format("%" + n + "s", answer[i].replace("1", "#"));
      }
 
      return answer;
  }
}