[HackerRank - python] ACM ICPC Team

아래 블로그의 방법이 파이썬스럽고 깔끔해보인다.

https://velog.io/@jongmin97/hackerRank-ACM-ICPC-Team

[HackerRank] ACM ICPC Team

 

def acmTeam(topic):
    # Write your code here
    result = [0, 0]
    
    for i in range(len(topic) - 1):
        for j in range(i + 1, len(topic)):
            sum_pair = str(int(topic[i]) + int(topic[j]))
            count = sum_pair.count('1') + sum_pair.count('2')
            
            if count > result[0]:
                result[0] = count
                result[1] = 1
            elif count == result[0]:
                result[1] += 1
            
    return result