[9월 코테 챌린지] 프로그래머스 :: (Lv0) 235개 (Lv1) 70개 (Lv2) 44개 (Lv3) 6개 // 누적 355개

2024/09/22

(Lv0) 235개 (Lv1) 70개 (Lv2) 44개 (Lv3) 6개 // 누적 355개

---

풀이한 문제

Lv1

1. 체육복

프로그래머스

 

---

문제 풀이

def solution(n, lost, reserve):
    more = []
    lost = lost[::-1]; reserve=reserve[::-1]
    reserve, lost = list(set(reserve)-set(lost)), list(set(lost)-set(reserve))
    
    for i in reserve:
        if i in lost:
            lost.remove(i)
        elif i+1 in lost:
            if i-1 in lost:
                more.append(i)
            else:
                lost.remove(i+1)
        elif i-1 in lost:
            lost.remove(i-1)
            
    for i in more:
        if i-1 in lost:
            lost.remove(i-1)
        elif i+1 in lost:
            lost.remove(i+1)
            
    answer = n - (len(lost))
    return answer

 

 

Lv1. 체육복

---

미완성 문제

Lv2

1. 피로도