Level1_비밀지도 (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++){
            StringBuilder sb = new StringBuilder();

            int temp = arr1[i]|arr2[i];
            int[] tempArr = makeBinary(n, temp);

            for(int j=0; j<n; j++){
                if(tempArr[j]==0)
                    sb.append(" ");
                else 
                    sb.append("#");
            }

            answer[i] = sb.toString();
        }

        return answer;
    }

    private static int[] makeBinary(int n, int num){
        int[] binaryArr = new int[n];
        int i=n-1;
        while(num!=1){
            binaryArr[i--] = num%2;
            num /= 2;
        }
        binaryArr[i] = num;

        return binaryArr;
    }
}

 

 

② Integer클래스 이용

class Solution {
    public String[] solution(int n, int[] arr1, int[] arr2) {
        String[] answer = new String[n];
        for(int i=0; i<n; i++){
            StringBuilder sb = new StringBuilder();

            int temp = arr1[i]|arr2[i];
            String tempToBinary = String.format("%"+n+"s", Integer.toBinaryString(temp));
            
            char[] tempArr = tempToBinary.toCharArray();

            for(int j=0; j<tempArr.length; j++){
                if(tempArr[j]=='1')
                    sb.append("#");
                else 
                    sb.append(" ");
            }

            answer[i] = sb.toString();
        }

        return answer;
    }
}

 

 

 

③ Integer클래스, String.replace() 이용

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

        return answer;
    }
}