https://programmers.co.kr/learn/courses/30/lessons/17681
import java.util.*;
class Solution {
public String[] solution(int n, int[] arr1, int[] arr2) {
int[][] arrB1 = new int[n][n];
int[][] arrB2 = new int[n][n];
for(int i = 0; i < n; i++){
int q = arr1[i];
for(int j = 0; j < n; j++){
arrB1[i][n-j-1] = q % 2;
q = q / 2;
}
}
for(int i = 0; i < n; i++){
int q = arr2[i];
for(int j = 0; j < n; j++){
arrB2[i][n-j-1] = q % 2;
q = q / 2;
}
}
String[][] arrAn = new String[n][n];
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
if(arrB1[i][j] == 0 && arrB2[i][j] == 0){
arrAn[i][j] = " ";
}else{
arrAn[i][j] = "#";
}
}
}
String[] answer = new String[n];
for(int i = 0; i < n; i++){
answer[i] = "";
for(int j = 0; j < n; j++){
answer[i] += arrAn[i][j];
}
}
return answer;
}
}
성공
'프로그래머스 > Lv.1' 카테고리의 다른 글
Lv.1 내적 (0) | 2022.07.04 |
---|---|
Lv.1 폰켓몬 (0) | 2022.07.01 |
Lv.1 약수의 개수와 덧셈 (0) | 2022.06.29 |
Lv.1 3진법 뒤집기 (0) | 2022.06.28 |
Lv.1 예산 (0) | 2022.06.28 |