🌿 나의 풀이 import java.util.*; class Solution { public long[] solution(long k, long[] room_number) { long[] answer = new long[room_number.length]; Map map = new HashMap(); for(int i = 0; i < room_number.length; i++){ answer[i] = dfs(room_number[i], map); } return answer; } public long dfs(long number, Map map) { if(!map.containsKey(number)){ // 빈 방이 있으면 map.put(number, number + 1); return number; }..