Climbing Stairs-LeetCode

You are climbing a stair case. It takes n steps to reach to the top.

Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?

 

DP解法，类似斐波那契数列

 1 public class Solution {
 2     public int climbStairs(int n) {
 3         int[] res=new int[n+1];
 4         res[0]=1;
 5         res[1]=1;
 6         
 7         for(int i=2; i<=n; i++){
 8             res[i]=res[i-1]+res[i-2];
 9         }
10         return res[n];
11     }
12 }

 

转载于:https://www.cnblogs.com/iisahu/p/3665338.html