💡 구현 문제
n = input()
length = len(n)
summary = 0
# 왼쪽 자리 수 힙
for i in range(length // 2) :
summary += int(n[i])
for i in range(length//2, length) :
summary -= int(n[i])
if summary == 0 :
print("LUCKY")
else :
print("READY")
💡 구현 문제
data = input()
alphabet = []
num = 0
for x in data :
if x.isalpha() :
alphabet.append(x)
else :
num += int(x)
alphabet.sort()
if num != 0 :
alphabet.append(str(num))
print(''.join(alphabet))
💡 완전 탐색
def solution(s) :
answer = len(s)
for step in range(1, len(s) // 2 + 1) :
compressed = ""
prev = s[0:step]
count = 1
for j in range(step, len(s), step) :
if prev == s[j:j + step] :
count += 1
else :
compressed += str(count) + prev if count >= 2 else prev
prev = s[j:j + step]
count = 1
compressed += str(count) + prev if count >= 2 else prev
answer = min(answer, len(compressed))
return answer
💡 구현 문제