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

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

코딩테스트 연습 - [1차] 비밀지도

class Solution {
    public String[] solution(int n, int[] arr1, int[] arr2) {
        
        String[] answer = new String[n];
        int[] binaryArr1 = new int[n];
		int[] binaryArr2 = new int[n];
		
		for(int i=0; i<n; i++) {
			for(int j=0; j<n; j++) {
				binaryArr1[n-1-j] = arr1[i]%2;
				arr1[i] = arr1[i]/2;
			}
			
			for(int j=0; j<n; j++) {
				binaryArr2[n-1-j] = arr2[i]%2;
				arr2[i] = arr2[i]/2;
			}
			
			StringBuffer sb = new StringBuffer();
			
			for(int j=0; j<n; j++) {
				if(binaryArr1[j]==0 && binaryArr2[j]==0) {
					sb.append(" ");
				}
				else {
					sb.append("#");
				}
			}
            	answer[i] = sb.toString();
			
		}
    
        return answer;
    }
}