比较两个相似的python代码(Project Euler # 3)

def largest_prime_factor(n):
    i = 2
    while i * i <= n:
        if n % i:
            i += 1
        else:
            n //= i
    if n > 1:
        return n
    return i

number = 600851475143
result = largest_prime_factor(number)
print(result)

def is_prime(num):
    if num < 2:
        return False
    for i in range(2, int(num ** 0.5) + 1):
        if num % i == 0:
            return False
    return True

def largest_prime_factor(n):
    i = 2
    while i * i <= n:
        if n % i == 0 and is_prime(i):
            n //= i
        else:
            i += 1
    if n > 1:
        return n
    return i

number = 600851475143
result = largest_prime_factor(number)
print(result)