프로그래머스 42840. 모의고사

https://school.programmers.co.kr/learn/courses/30/lessons/42840

프로그래머스

def solution(answers):
    first = [1,2,3,4,5]
    second = [2,1,2,3,2,4,2,5]
    third = [3,3,1,1,2,2,4,4,5,5]
    first_cnt, second_cnt, third_cnt = 0,0,0
    for i in range(len(answers)):
        if answers[i] == first[i%5]:
            first_cnt += 1
        if answers[i] == second[i%8]:
            second_cnt += 1
        if answers[i] == third[i%10]:
            third_cnt += 1
    
    answer = []
    max_score = max(first_cnt,second_cnt,third_cnt)
    if first_cnt == max_score:
        answer.append(1)
    if second_cnt == max_score:
        answer.append(2)
    if third_cnt == max_score:
        answer.append(3)
        
    return answer

더 깔끔한 다른사람의 풀이

def solution(answers):
    pattern1 = [1,2,3,4,5]
    pattern2 = [2,1,2,3,2,4,2,5]
    pattern3 = [3,3,1,1,2,2,4,4,5,5]
    score = [0, 0, 0]
    result = []

    for idx, answer in enumerate(answers):
        if answer == pattern1[idx%len(pattern1)]:
            score[0] += 1
        if answer == pattern2[idx%len(pattern2)]:
            score[1] += 1
        if answer == pattern3[idx%len(pattern3)]:
            score[2] += 1

    for idx, s in enumerate(score):
        if s == max(score):
            result.append(idx+1)

    return result