0
private void initQueue()
1
{
2
    ONE.clear();
3
    TWO.clear();
4
    THREE.clear();
5
    
6
    ONE.add(1);
7
    ONE.add(2);
8
    ONE.add(3);
9
    ONE.add(4);
10
    ONE.add(5);
11
    
12
    TWO.add(2);
13
    TWO.add(1);
14
    TWO.add(2);
15
    TWO.add(3);
16
    TWO.add(2);
17
    TWO.add(4);
18
    TWO.add(2);
19
    TWO.add(5);
20
    
21
    THREE.add(3);
22
    THREE.add(3);
23
    THREE.add(1);
24
    THREE.add(1);
25
    THREE.add(2);
26
    THREE.add(2);
27
    THREE.add(4);
28
    THREE.add(4);
29
    THREE.add(5);
30
    THREE.add(5);
31
}

0
for (int item : answers)
1
{
2
    int one = Objects.requireNonNull(ONE.poll());
3
    int two = Objects.requireNonNull(TWO.poll());
4
    int three = Objects.requireNonNull(THREE.poll());
5
    
6
    counts[0] += item == one ? 1 : 0;
7
    counts[1] += item == two ? 1 : 0;
8
    counts[2] += item == three ? 1 : 0;
9
    
10
    ONE.add(one);
11
    TWO.add(two);
12
    THREE.add(three);
13
}

0
int max = Arrays.stream(counts).max().getAsInt();

0
import java.util.ArrayList;
1
import java.util.Arrays;
2
import java.util.LinkedList;
3
import java.util.Objects;
4
import java.util.Queue;
5

6
/**
7
 * 모의고사 클래스
8
 *
9
 * @author RWB
10
 * @since 2021.12.10 Fri 21:43:26
11
 */
12
class Solution
13
{
14
    private static final Queue<Integer> ONE = new LinkedList<>();
15
    private static final Queue<Integer> TWO = new LinkedList<>();
16
    private static final Queue<Integer> THREE = new LinkedList<>();
17
    
18
    /**
19
     * 해답 반환 메서드
20
     *
21
     * @param answers: [int[]] 최고 득점자
22
     *
23
     * @return [int[]] 해답
24
     */
25
    public int[] solution(int[] answers)
26
    {
27
        initQueue();
28
        
29
        int[] counts = { 0, 0, 0 };
30
        
31
        for (int item : answers)
32
        {
33
            int one = Objects.requireNonNull(ONE.poll());
34
            int two = Objects.requireNonNull(TWO.poll());
35
            int three = Objects.requireNonNull(THREE.poll());
36
            
37
            counts[0] += item == one ? 1 : 0;
38
            counts[1] += item == two ? 1 : 0;
39
            counts[2] += item == three ? 1 : 0;
40
            
41
            ONE.add(one);
42
            TWO.add(two);
43
            THREE.add(three);
44
        }
45
        
46
        int max = Arrays.stream(counts).max().getAsInt();
47
        
48
        ArrayList<Integer> list = new ArrayList<>();
49
        
50
        for (int i = 0; i < counts.length; i++)
51
        {
52
            // 최고 점수를 얻었을 경우
53
            if (counts[i] == max)
54
            {
55
                list.add(i + 1);
56
            }
57
        }
58
        
59
        return list.stream().mapToInt(Integer::intValue).toArray();
60
    }
61
    
62
    /**
63
     * 큐 초기화 메서드
64
     */
65
    private void initQueue()
66
    {
67
        ONE.clear();
68
        TWO.clear();
69
        THREE.clear();
70
        
71
        ONE.add(1);
72
        ONE.add(2);
73
        ONE.add(3);
74
        ONE.add(4);
75
        ONE.add(5);
76
        
77
        TWO.add(2);
78
        TWO.add(1);
79
        TWO.add(2);
80
        TWO.add(3);
81
        TWO.add(2);
82
        TWO.add(4);
83
        TWO.add(2);
84
        TWO.add(5);
85
        
86
        THREE.add(3);
87
        THREE.add(3);
88
        THREE.add(1);
89
        THREE.add(1);
90
        THREE.add(2);
91
        THREE.add(2);
92
        THREE.add(4);
93
        THREE.add(4);
94
        THREE.add(5);
95
        THREE.add(5);
96
    }
97
}