# 上台阶,方法比较简单,主要体会递归的思想
def taijie (num):
if num ==0:
return 0
if num==1:
return 1
else:
return taijie(n-1)+taijie(n-2)
转载于:https://www.cnblogs.com/caozijian-zm/p/10300071.html
# 上台阶,方法比较简单,主要体会递归的思想
def taijie (num):
if num ==0:
return 0
if num==1:
return 1
else:
return taijie(n-1)+taijie(n-2)
转载于:https://www.cnblogs.com/caozijian-zm/p/10300071.html