mirror of
				https://github.com/krahets/hello-algo.git
				synced 2025-11-01 03:24:24 +08:00 
			
		
		
		
	 954c45864b
			
		
	
	954c45864b
	
	
	
		
			
			* docs: add Japanese documents (`ja/docs`) * docs: add Japanese documents (`ja/codes`) * docs: add Japanese documents * Remove pythontutor blocks in ja/ * Add an empty at the end of each markdown file. * Add the missing figures (use the English version temporarily). * Add index.md for Japanese version. * Add index.html for Japanese version. * Add missing index.assets * Fix backtracking_algorithm.md for Japanese version. * Add avatar_eltociear.jpg. Fix image links on the Japanese landing page. * Add the Japanese banner. --------- Co-authored-by: krahets <krahets@163.com>
		
			
				
	
	
		
			69 lines
		
	
	
		
			1.7 KiB
		
	
	
	
		
			Python
		
	
	
	
	
	
			
		
		
	
	
			69 lines
		
	
	
		
			1.7 KiB
		
	
	
	
		
			Python
		
	
	
	
	
	
| """
 | |
| File: recursion.py
 | |
| Created Time: 2023-08-24
 | |
| Author: krahets (krahets@163.com)
 | |
| """
 | |
| 
 | |
| 
 | |
| def recur(n: int) -> int:
 | |
|     """再帰"""
 | |
|     # 終了条件
 | |
|     if n == 1:
 | |
|         return 1
 | |
|     # 再帰:再帰呼び出し
 | |
|     res = recur(n - 1)
 | |
|     # 復帰:結果を返す
 | |
|     return n + res
 | |
| 
 | |
| 
 | |
| def for_loop_recur(n: int) -> int:
 | |
|     """反復で再帰をシミュレート"""
 | |
|     # 明示的なスタックを使用してシステムコールスタックをシミュレート
 | |
|     stack = []
 | |
|     res = 0
 | |
|     # 再帰:再帰呼び出し
 | |
|     for i in range(n, 0, -1):
 | |
|         # 「スタックへのプッシュ」で「再帰」をシミュレート
 | |
|         stack.append(i)
 | |
|     # 復帰:結果を返す
 | |
|     while stack:
 | |
|         # 「スタックからのポップ」で「復帰」をシミュレート
 | |
|         res += stack.pop()
 | |
|     # res = 1+2+3+...+n
 | |
|     return res
 | |
| 
 | |
| 
 | |
| def tail_recur(n, res):
 | |
|     """末尾再帰"""
 | |
|     # 終了条件
 | |
|     if n == 0:
 | |
|         return res
 | |
|     # 末尾再帰呼び出し
 | |
|     return tail_recur(n - 1, res + n)
 | |
| 
 | |
| 
 | |
| def fib(n: int) -> int:
 | |
|     """フィボナッチ数列:再帰"""
 | |
|     # 終了条件 f(1) = 0, f(2) = 1
 | |
|     if n == 1 or n == 2:
 | |
|         return n - 1
 | |
|     # 再帰呼び出し f(n) = f(n-1) + f(n-2)
 | |
|     res = fib(n - 1) + fib(n - 2)
 | |
|     # 結果 f(n) を返す
 | |
|     return res
 | |
| 
 | |
| 
 | |
| """Driver Code"""
 | |
| if __name__ == "__main__":
 | |
|     n = 5
 | |
|     res = recur(n)
 | |
|     print(f"\n再帰関数の合計結果 res = {res}")
 | |
| 
 | |
|     res = for_loop_recur(n)
 | |
|     print(f"\n反復で再帰をシミュレートする合計結果 res = {res}")
 | |
| 
 | |
|     res = tail_recur(n, 0)
 | |
|     print(f"\n末尾再帰関数の合計結果 res = {res}")
 | |
| 
 | |
|     res = fib(n)
 | |
|     print(f"\nフィボナッチ数列の第 {n} 項は {res} です") |