PROGRAMMERS 17684: [3차] 압축

Link : programmers.co.kr/learn/courses/30/lessons/17684

---

Python

alphabet = dict()
for i in range(26):
    alphabet[chr(i + 65)] = i + 1
def solution(msg):
    maxlength = 1
    answer = []
    pos = 0
    while pos < len(msg):
        for i in range(maxlength, 0, -1):
            if msg[pos:pos + i] in alphabet:
                answer.append(alphabet[msg[pos:pos + i]])
                alphabet[msg[pos:pos + i + 1]] = len(alphabet) + 1
                maxlength = maxlength if i + 1 < maxlength else i + 1
                pos += i
                break
    return answer

FeedBack

1.  

---

 

 

 

cjw.git@gmail.com