class Solution {
public int[][] solution(int[] num_list, int n) {
int[][] answer = new int[num_list.length/n ][n];
int count = 0;
for(int i = 0; i < num_list.length / n ; i++){
for(int j = 0; j < n; j++){
answer[i][j] = num_list[count];
count++;
}
}
return answer;
}
}
2차원 배열을 확인할 땐
System.out.println(Arrays.deepToString(answer));
deepToString을 써야되는걸 알게되었다.