[JAVA/프로그래머스] 2018 KAKAO BLIND RECRUITMENT: [1차] 비밀지도

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
import java.util.*;
/**
 *
 * @author HEESOO
 *
 */
 class Solution {
     public String makeZero(String str, int n){//이진수 앞에 0을 채워주는 함수
         int cnt=n-str.length();
         while(cnt>0){
             str="0"+str;
             cnt--;
         }
         return str;
     }
     public String[] solution(int n, int[] arr1, int[] arr2) {
       String[] answer = {};
       answer=new String[n];
       Arrays.fill(answer,"");
       String str1="", str2="";
       int numSize=0;
       for(int i=0;i<n;i++){
           str1=Integer.toBinaryString(arr1[i]);//이진수 변환
           str2=Integer.toBinaryString(arr2[i]);  
           str1=makeZero(str1, n);
           str2=makeZero(str2, n);
           for(int j=0;j<n;j++){
               if(str1.charAt(j)=='0'&&str2.charAt(j)=='0')
                   answer[i]+=" ";
               else
                   answer[i]+="#";
           }
       }
       return answer;
     }
 }