[프로그래머스]모의고사, 최소직사각형

모의고사

def solution(answers):
    list2= [2,1,2,3,2,4,2,5]
    list3 = [3,3,1,1,2,2,4,4,5,5]
    total = [0,0,0]
    for i in range(len(answers)):
        if(answers[i]==((i)%5+1)):
            total[0]+=1
        if(answers[i]==(list2[(i)%len(list2)])):
            total[1]+=1
        if(answers[i]==(list3[(i)%len(list3)])):
            total[2]+=1
           
    high_score=max(total)
    rettt=[i+1 for i in range(len(total)) if high_score == total[i]]
    return rettt

최소직사각형

def solution(sizes):
    xlist = []
    ylist = []
    for i in sizes:
        xlist.append(max(i))
        ylist.append(min(i))
    return (max(xlist) * max(ylist))