[210120 TIL] Programmers Algorithm(Hash, Greedy)

Today I Learned

written by 602

---

Programmers) Hash 01. 완주하지 못한 선수

def solution(participant, completion):
    participant.sort()
    completion.sort()
    for p, c in zip(participant, completion):
        if p != c:
            return p
            
    return participant[-1]

Programmers) Greedy 01. 체육복

def solution(n, lost, reserve):
    answer = 0
    new_lost  = list(set(lost) - set(reserve))
    new_reserve = list(set(reserve) - set(lost))
    for i in range(1,n+1):
        if i not in new_lost:
            answer += 1
            continue
        else:
            if i in new_reserve:
                answer += 1
                new_reserve.remove(i)
            else:
                if i+1 in new_reserve:
                    answer += 1
                    new_reserve.remove(i+1)
                elif i-1 in new_reserve:
                    answer += 1
                    new_reserve.remove(i-1)
    return answer

알고리즘 다시 열심히 달려보자!

내일부터는 주석도 꼼꼼하게 달기