김도현

import java.util.ArrayList; import java.util.Arrays; public class Programmers_brute_force { public static int[] solution(int[] answers) { int[] cnt = {0, 0, 0}; // 1. int[] one = {1, 2, 3, 4, 5}; int[] two = {2, 1, 2, 3, 2, 4, 2, 5}; int[] three = {3, 3, 1, 1, 2, 2, 4, 4, 5, 5}; // 2. for (int i = 0; i < answers.length; i++) { if (answers[i] == one[i % 5]) cnt[0]++; if (answers[i] == two[i % 8]) cnt[1]++; if (answers[i] == three[i % 10]) cnt[2]++; } // 3. int max = Math.max(Math.max(cnt[0], cnt[1]), cnt[2]); // 4. ArrayList<Integer> list = new ArrayList<>(); for (int i = 0; i < cnt.length; i++) { if(max == cnt[i]) list.add(i+1); } // 5. int[] answer = new int[list.size()]; for (int i = 0; i < list.size(); i++) { answer[i] = list.get(i); } return answer; } public static void main(String[] args) { System.out.println(Arrays.toString(solution(new int[]{1,2,3,4,5}))); // 1 System.out.println(Arrays.toString(solution(new int[]{1,3,2,4,2}))); // 1, 2, 3 } }