https://blog.sundayhk.com/tags/%E9%80%92%E5%BD%92/ Recent content in 递归 on Sunday Blog Hugo -- gohugo.io zh-cn Sun, 14 Aug 2022 17:35:40 +0800 https://blog.sundayhk.com/post/factorial/ Sun, 14 Aug 2022 17:35:40 +0800 https://blog.sundayhk.com/post/factorial/ 0!=1 1!=1 2!=1*2 3!=1*2*3 4!=1*2*3*4 ... for def factorial(n): p=1 for i in range(1,n): p*=i return p print(factorial(5)) 120 for递归 def factorial(n,p=1): if n==1: return p p*=n return factorial(n-1,p) print(factorial(6)) 720 def factorial(n,p=1): return p if n<2 else factorial(n-1,p*n) print(factorial(5)) 公式法 def factorial(n): if n< 2: return n return n*factorial(n-1) print(factorial(5)) 120 https://blog.sundayhk.com/post/fibonacci-sequence/ Sat, 13 Aug 2022 21:17:18 +0800 https://blog.sundayhk.com/post/fibonacci-sequence/ 斐波那契数列指的是这样一个数列：1，1，2，3，5，8，13，21，34，55，89… 这个数列从第3项开始，每一项都等于前两项