python习题四

#递归实现N的阶乘
def fac(n):
    if n == 1:
        return 1
    return n * fac(n-1)
fac(5)

#递归实现,猴子吃桃,共x个桃子,每天吃掉一半+1个,第10天准备吃时发现剩1,求x
def eat(day,num):
    num = (num+1)*2
    if day == 2:#实际上只有九天，需要减去一天
        return num
    return eat(day-1,num)
eat(10,1)

#递归实现一个数逆序放入列表
def rev(num,string='',n=[]):
    l1 = list(str(num)) if isinstance(num,int) else num
    if not l1:
        n.append(int(string))
        return n
    else:
        a = l1.pop()
       # print(a,type(string),'.',l1)
        return rev(l1,string+a)
rev(123456789)

%%timeit
#递归实现一个数逆序放入列表
def reverced(num):
    nlist = list(str(num))
    acc=[]
    def foo(n=len(nlist)):
        if n == 1:
            return acc.append