hailstone 递归实现

image.png

def hailstone(n):
    a = [n]
    if n <= 1:
        return [1]
    elif n % 2 == 0:
        a.extend(hailstone(int(n / 2)))
        return a
    else:
        a.extend(hailstone(3 * n + 1))
        return a
c = hailstone(10)
print(c)