509. 斐波那契数
题目链接:509. 斐波那契数 - 力扣(LeetCode)
class Solution {
public int fib(int n) {
if(n <= 1) {
return n;
}
int[] dp = new int[n + 1];
dp[0] = 0;
dp[1] = 1;
for(int i = 2; i < n + 1; ++i) {
dp[i] = dp[i-1] + dp[i-2];
}
return dp[n];
}
}
70. 爬楼梯
class Solution {
public int climbStairs(int n) {
int[] dp = new int[n];
if(n <= 2) {
return 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. 使用最小花费爬楼梯
题目链接:746. 使用最小花费爬楼梯 - 力扣(LeetCode)
class Solution {
public int minCostClimbingStairs(int[] cost) {
int n = cost.length;
int[] dp = new int[n];
dp[0] = cost[0];
dp[1] = cost[1];
for(int i = 2; i < n; ++i) {
dp[i] = Math.min(dp[i-1],dp[i-2]) + cost[i];
}
return Math.min(dp[n-1], dp[n-2]);
}
}