모의고사

yongju·2024년 9월 1일
0

Programmers

목록 보기
24/25

def solution(answers):
    s1_answer, s2_answer, s3_answer=0, 0, 0
    winner=[]
    
    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]

    s1+=s1*(len(answers)//len(s1))
    s2+=s2*(len(answers)//len(s2))
    s3+=s3*(len(answers)//len(s3))
    
    for i in range(len(answers)):
        if s1[i]==answers[i]:
            s1_answer+=1
        if s2[i]==answers[i]:
            s2_answer+=1
        if s3[i]==answers[i]:
            s3_answer+=1
    if max(s1_answer, s2_answer, s3_answer)==s1_answer:
        winner.append(1)
    if max(s1_answer, s2_answer, s3_answer)==s2_answer:
        winner.append(2)
    if max(s1_answer, s2_answer, s3_answer)==s3_answer:
        winner.append(3)
    return winner

profile
SI DEV

0개의 댓글