김지수

public int[] solution(int[] arr) { int[] student1 = new int[]{1, 2, 3, 4, 5}; int[] student2 = new int[]{2, 1, 2, 3, 2, 4, 2, 5}; int[] student3 = new int[]{3, 3, 1, 1, 2, 2, 4, 4, 5, 5}; int[] cnt = new int[3]; List<Integer> tmp = new ArrayList<>(); for (int i = 0; i < arr.length; i++) { if (student1[i % student1.length] == arr[i]) cnt[0]++; if (student2[i % student2.length] == arr[i]) cnt[1]++; if (student3[i % student3.length] == arr[i]) cnt[2]++; } int max = Math.max(cnt[0], Math.max(cnt[1], cnt[2])); for (int i = 0; i < cnt.length; i++) { if (max == cnt[i]) tmp.add(i + 1); } int[] ans = new int[tmp.size()]; int idx = 0; for (int num : tmp) { ans[idx++] = num; } return ans; }