[프로그래머스] 1단계 완전탐색 모의고사 python

def solution(answers):
    final = []
    scores = [0, 0, 0]
    s1 = [1, 2, 3, 4, 5]
    s2 = [2, 1, 2, 3, 2, 4, 2, 5]
    s3 = [3, 3, 1, 1, 2, 2, 4, 4, 5, 5]
    
    for idx, answer in enumerate(answers):
        if answer == s1[idx%len(s1)]:
            scores[0] += 1
        if answer == s2[idx%len(s2)]:
            scores[1] += 1
        if answer == s3[idx%len(s3)]:
            scores[2] += 1
    
    for idx, score in enumerate(scores):
        if score == max(scores):
            final.append(idx+1)
    return final

문제 집에 가서 다시 풀어보기

enumerate !