class Solution {
public int fib(int n) {
if(n == 0)
return 0;
if(n == 1)
return 1;
return fib(n-1) + fib(n-2);
}
}
class Solution {
public int climbStairs(int n) {
if(n==1)
return 1;
int[] dp = new int[n];
dp[0] = 1;
dp[1] = 2;
for(int i = 2;i<n;i++){
dp[i] = dp[i-1] + dp[i-2];
}
return dp[n-1];
}
}
746. 使用最小花费爬楼梯
class Solution {
public int minCostClimbingStairs(int[] cost) {
int[] dp = new int[cost.length];
dp[0] = cost[0];
dp[1] =cost[1];
for(int i = 2;i<cost.length;i++){
int min = Math.min(dp[i-1],dp[i-2]);
dp[i] = min+cost[i];
}
return Math.min(dp[cost.length-1],dp[cost.length-2]);
}
}