(Python/LV2) 압축

문제 출처: https://school.programmers.co.kr/learn/courses/30/lessons/17684

프로그래머스

풀이:

def solution(msg):
    res = []
    dic = {chr(i): i-64 for i in range(ord('A'),ord('Z')+1)}
    num = 27
    while msg:
        start = 1
        while msg[:start] in dic.keys() and start <= len(msg):
            start += 1
        res.append(dic[msg[:start -1]])
        dic[msg[:start]] = num
        num += 1

        msg = msg[start-1:]
    return res

 

힙을 사용했지만 조금 틀림

import heapq
def solution(scoville, K):
    count = 0
    heapq.heapify(scoville)
    while scoville[0] < K :
        heapq.heappush(scoville, heapq.heappop(scoville) + (heapq.heappop(scoville)*2))
        count += 1
    return -1 if len(scoville) == 1 or scoville[0] < K else count

 

 

import heapq
def solution(scoville, K):
    count = 0
    heapq.heapify(scoville)
    while scoville[0] < K :
        heapq.heappush(scoville, heapq.heappop(scoville) + (heapq.heappop(scoville)*2))
        count += 1
        if len(scoville) == 1 and scoville[0] < K :
            return -1
    return count

or 가 아니라 and 였고

-1 경우를 while 문 안에 넣었어야함