[TIL_Carrotww] 35 - 22/10/21

📝Carrotww의 코딩 기록장

🧲 python Algorithm

🔍 programmers 체육복 그리디 문제이다.

• 풀이

def solution(n, lost, reserve):
    cnt = 0
    lost_temp = [x for x in lost if x not in reserve]
    reserve_temp = [x for x in reserve if x not in lost]

    lost_temp.sort()
    reserve_temp.sort()

    for lo in lost_temp:
        for i in range(len(reserve_temp)):
            if lo - 1 == reserve[i] or lo + 1 == reserve[i]:
                reserve[i] = -1
                break
        else:
            cnt += 1

    return n - cnt

🔍 programmers 디스트 컨트롤러 Heap 문제이다

• 풀이

import heapq

def solution(jobs):
    start, end, i, result = -1, 0, 0, 0
    heap = list()

    while i < len(jobs):
        for job in jobs:
            if start < job[0] <= end:
                heapq.heappush(heap, [job[1], job[0]])

        if 0 < len(heap):
            temp = heapq.heappop(heap)
            start = end
            end += temp[0]
            result += end - temp[1]
            i += 1
        else:
            end += 1

    return result // len(jobs)