Question:
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?
//********** Hints ************
150里的原题,不会就说不过去了
recursion超时,需要用DP
//*****************************
Solution:public class Solution {
public int climbStairs(int n) {
int[] dp = new int[n];
dp[0] =1;
for(int i = 1; i < n; i++){
if( i == 1){
dp[1] = 2;
}
else dp[i] = dp[i-1] + dp[i-2];
}
return dp[n-1];
}
}