Algorithm/Algorithm/Programmers/모의고사.java at main · LineYK/Algorithm · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
// 모의고사 (https://school.programmers.co.kr/learn/courses/30/lessons/42840)

import java.util.ArrayList;
import java.util.List;

class Solution {

    public int[] solution(int[] answers) {
        int[] s1 = new int[] { 1, 2, 3, 4, 5 };
        int[] s2 = new int[] { 2, 1, 2, 3, 2, 4, 2, 5 };
        int[] s3 = new int[] { 3, 3, 1, 1, 2, 2, 4, 4, 5, 5 };

        int[] counts = new int[3];

        for (int i = 0; i < answers.length; i++) {
            if (s1[i % s1.length] == answers[i])
                counts[0]++;
            if (s2[i % s2.length] == answers[i])
                counts[1]++;
            if (s3[i % s3.length] == answers[i])
                counts[2]++;
        }

        int index = 0;

        for (int i = 0, max = 0; i < counts.length; i++) {
            if (max < counts[i]) {
                max = counts[i];
                index = i;
            }
        }

        List<Integer> resList = new ArrayList<>();

        if (index == 0) {
            resList.add(1);
            if (counts[index] == counts[index + 1])
                resList.add(2);
            if (counts[index] == counts[index + 2])
                resList.add(3);
        }
        if (index == 1) {
            resList.add(2);
            if (counts[index] == counts[index + 1])
                resList.add(3);
        }

        if (index == 2) {
            resList.add(3);
        }

        return resList.stream().mapToInt(Integer::intValue).toArray();
    }

    // 위보다 1ms 느림
    public int[] solution2(int[] answers) {
        int[] s1 = new int[] { 1, 2, 3, 4, 5 };
        int[] s2 = new int[] { 2, 1, 2, 3, 2, 4, 2, 5 };
        int[] s3 = new int[] { 3, 3, 1, 1, 2, 2, 4, 4, 5, 5 };

        int[] counts = new int[3];

        for (int i = 0; i < answers.length; i++) {
            if (s1[i % s1.length] == answers[i])
                counts[0]++;
            if (s2[i % s2.length] == answers[i])
                counts[1]++;
            if (s3[i % s3.length] == answers[i])
                counts[2]++;
        }

        int maxCnt = Math.max(counts[0], Math.max(counts[1], counts[2]));

        List<Integer> resList = new ArrayList<>();

        if(maxCnt == counts[0]) resList.add(1);
        if(maxCnt == counts[1]) resList.add(2);
        if(maxCnt == counts[2]) resList.add(3);

        return resList.stream().mapToInt(Integer::intValue).toArray();
    }
}