[프로그래밍] 프로그래머스 예제문제 풀어보기 <모의고사> 성공

import java.util.*;
 
class Solution {
    public int[] solution(int[] answers) {
        
        int[] soopo1 = {1,2,3,4,5};
        int[] soopo2 = {2,1,2,3,2,4,2,5};
        int[] soopo3 = {3,3,1,1,2,2,4,4,5,5};
        
        int indexTemp1 = 5;
        int indexTemp2 = 8;
        int indexTemp3 = 10;
        
        int succ1 = 0;
        int succ2 = 0;
        int succ3 = 0;
        
        for(int j = 0 ; j < answers.length ; j ++){
            int indexTrans1 = (j+indexTemp1) % indexTemp1;    
            int indexTrans2 = (j+indexTemp2) % indexTemp2;  
            int indexTrans3 = (j+indexTemp3) % indexTemp3;  
            
            if(answers[j] == soopo1[indexTrans1]){
                succ1 ++;
            }
            if(answers[j] == soopo2[indexTrans2]){
                succ2 ++;
            }
            if(answers[j] == soopo3[indexTrans3]){
                succ3 ++;
            } 
        }        
        
        
        int max = succ1;
        max = (max>succ2) ? max:succ2 ;
        max = (max>succ3) ? max:succ3 ;
        
        
        ArrayList<Integer> answerTemp = new ArrayList<>();
        int[] succArray = new int[]{succ1,succ2,succ3};
        for(int i = 0; i < 3 ; i++) {             
            if (succArray[i] == max){
                 answerTemp.add(i+1);
            }         
        }
 
 
        int[] answer = new int[answerTemp.size()];
        for(int k =0 ; k < answer.length ; k++){
            answer[k] = answerTemp.get(k);
        }
        
        for(int h = 0 ; h < answer.length ; h ++){
            System.out.println(answer[h]);
        }
              
        return answer;
    }
}