1. 程式人生 > >遞歸實例

遞歸實例

python 遞歸

  • 計算階乘:n! = 1*2*3*...n

#/usr/bin/env python
def func(n):
    if n == 1:
        return 1
    return n*func(n-1)
  • 菲波那切數列:0,1,1,2,3,5,8,13,21,34......

#!/usr/bin/env python
#-*- encoding:utf-8 -*-

def func(n):
    if n == 0:
        return 0
    if n == 1:
        return 1
    else:
        resault = int(func(n-1))+int(func(n-2))
        return resault

n = raw_input("請輸入你要輸出fabonacci數列的第幾位:\n")
for i in range(n):
    print func(n)


本文出自 “挨刀客” 博客,請務必保留此出處http://chboy.blog.51cto.com/9959876/1930703

遞歸實例