알고리즘 - 배열 만들기 2

def to_05(k):
    return int(bin(k)[2:].replace('1', '5'))
 
def solution(l: int, r: int):
    ans = []
    k = 1
 
    while True:
        val = to_05(k)
        if val > r:
            break
        if val >= l:
            ans.append(val)
        k += 1
 
    return ans if ans else [-1]

def solution(l, r):
    answer = []
    for x in range(l, r + 1):
        s = str(x)
        if all(ch in ['0', '5'] for ch in s):
            answer.append(x)
    return answer or [-1]