Project Euler问题26小数形式的Python字符串限制

def decimal_form(n):
    remainder = 1 % n
    decimals = []
    while remainder != 0 and remainder not in decimals:
        decimals.append(remainder)
        remainder = (remainder * 10) % n
    if remainder == 0:
        return ""
    else:
        return "".join(str(digit) for digit in decimals[decimals.index(remainder):])

def recurring_cycle_length(n):
    decimals = decimal_form(n)
    return len(decimals)

def find_longest_recurring_cycle(limit):
    max_length = 0
    max_number = 0
    for number in range(2, limit):
        length = recurring_cycle_length(number)
        if length > max_length:
            max_length = length
            max_number = number
    return max_number