프로그래머스 Lv1 | 완전탐색 | 모의고사

시도2.. 반복되는 코드는 더 짧고 간단하게 짤 수 있었다

def cal_score(answers,player):
    score = 0
    for i in range(len(answers)):
        if answers[i] == player[i%len(player)]:
            score += 1
            
    return score

def solution(answers):
    player1 = [1,2,3,4,5]
    player2 = [2, 1, 2, 3, 2, 4, 2, 5]
    player3 = [3, 3, 1, 1, 2, 2, 4, 4, 5, 5]
    
    score = []
    winner = []
    
    score.append(cal_score(answers,player1))
    score.append(cal_score(answers,player2))
    score.append(cal_score(answers,player3))
    
    for i, s in enumerate(score):
        if s == max(score):
            winner.append(i+1)
        
    return winner

 

 

 

---

 

시도 1.. 더 깔끔하게 풀 수 있었을 것 같은데 좀 지저분,,

아이디어 자체는 맞았는데 좀 아쉬운 풀이

# player 1 점수 계산
# 1 2 3 4 5 / 1 2 3 4 5 / 1 2 3 4 5 ... (5개씩 반복)
def cal_1(answers,len_answer):
    player = [1,2,3,4,5]
    
    score = 0
    for i in range(len_answer):
        if answers[i] == player[i%5]:
            score += 1
            
    return score

# player 2 점수 계산
# 2 1 2 3 2 4 2 5 / 2 1 2 3 2 4 2 5/ 2 1 2 3 2 4 2 5 / ... (8개씩 반복)
def cal_2(answers,len_answer):
    player = [2, 1, 2, 3, 2, 4, 2, 5]
    
    score = 0
    for i in range(len_answer):
        if answers[i] == player[i%8]:
            score += 1
            
    return score

# player 3 점수 계산
# 3 3 1 1 2 2 4 4 5 5 / 3 3 1 1 2 2 4 4 5 5 / ... (10개씩 반복)
def cal_3(answers,len_answer):
    player = [3, 3, 1, 1, 2, 2, 4, 4, 5, 5]
    
    score = 0
    for i in range(len_answer):
        if answers[i] == player[i%10]:
            score += 1
            
    return score

def solution(answers):
    
    score = []
    
    len_answer = len(answers)
    score.append(cal_1(answers,len_answer))
    score.append(cal_2(answers,len_answer))
    score.append(cal_3(answers,len_answer))
    
    max_score = max(score)
    
    winner = []
    for i in range(3):
        if score[i] == max_score: winner.append(i+1)
        
    return winner