mirror of
				https://github.com/krahets/hello-algo.git
				synced 2025-10-31 18:37:48 +08:00 
			
		
		
		
	 56b20eff36
			
		
	
	56b20eff36
	
	
	
		
			
			* .net 8.0 migration * update docs * revert change * revert change and update appendix docs * remove static * Update binary_search_insertion.cs * Update binary_search_insertion.cs * Update binary_search_edge.cs * Update binary_search_insertion.cs * Update binary_search_edge.cs --------- Co-authored-by: Yudong Jin <krahets@163.com>
		
			
				
	
	
		
			32 lines
		
	
	
		
			711 B
		
	
	
	
		
			C#
		
	
	
	
	
	
			
		
		
	
	
			32 lines
		
	
	
		
			711 B
		
	
	
	
		
			C#
		
	
	
	
	
	
| /**
 | |
| * File: climbing_stairs_dfs.cs
 | |
| * Created Time: 2023-06-30
 | |
| * Author: hpstory (hpstory1024@163.com)
 | |
| */
 | |
| 
 | |
| namespace hello_algo.chapter_dynamic_programming;
 | |
| 
 | |
| public class climbing_stairs_dfs {
 | |
|     /* 搜索 */
 | |
|     int DFS(int i) {
 | |
|         // 已知 dp[1] 和 dp[2] ,返回之
 | |
|         if (i == 1 || i == 2)
 | |
|             return i;
 | |
|         // dp[i] = dp[i-1] + dp[i-2]
 | |
|         int count = DFS(i - 1) + DFS(i - 2);
 | |
|         return count;
 | |
|     }
 | |
| 
 | |
|     /* 爬楼梯:搜索 */
 | |
|     int ClimbingStairsDFS(int n) {
 | |
|         return DFS(n);
 | |
|     }
 | |
| 
 | |
|     [Test]
 | |
|     public void Test() {
 | |
|         int n = 9;
 | |
|         int res = ClimbingStairsDFS(n);
 | |
|         Console.WriteLine($"爬 {n} 阶楼梯共有 {res} 种方案");
 | |
|     }
 | |
| }
 |