Leetcode 509. 斐波那契数
题目链接
思路:这里使用动态规划的思路去解题,分五步:
- 确定dp数组以及下标的含义
- 确定递推公式
- dp数组如何初始化
- 确定遍历顺序
- 举例推导dp数组
代码:
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; i++) {
dp[i] = dp[i - 1] + dp[i - 2];
}
return dp[n];
}
}
时间复杂度:O(n)
空间复杂度:O(n)
class Solution {
public int fib(int n) {
// 动态规划思路:进行压缩
if (n <= 1) {
return n;
}
int a = 0;
int b = 1;
int sum = 0;
for (int i = 1; i < n; i++) {
sum = a + b;
a = b;
b = sum;
}
return sum;
}
}
时间复杂度:O(n)
空间复杂度:O(1)
Leetcode 70. 爬楼梯
思路:动态规划
代码:
class Solution {
public int climbStairs(int n) {
if (n <= 1) {
return n;
}
int[] dp = new int[n + 1];
dp[1] = 1;
dp[2] = 2;
for (int i = 3; i <= n; i++) {
dp[i] = dp[i - 1] + dp[i - 2];
}
return dp[n];
}
}
时间复杂度:O(n)
空间复杂度:O(n)
class Solution {
public int climbStairs(int n) {
if (n <= 2) {
return n;
}
int a = 1;
int b = 2;
int sum = 0;
for (int i = 3; i <= n; i++) {
sum = a + b;
a = b;
b = sum;
}
return sum;
}
}
时间复杂度:O(n)
空间复杂度:O(1)
Leetcode 746. 使用最小花费爬楼梯
题目链接
思路:动态规划
代码:
class Solution {
public int minCostClimbingStairs(int[] cost) {
int[] dp = new int[cost.length + 1];
dp[0] = 0;
dp[1] = 0;
// 计算到达每一层台阶的最小费用
for (int i = 2; i <= cost.length; i++) {
dp[i] = Math.min(dp[i - 1] + cost[i - 1], dp[i - 2] + cost[i - 2]);
}
return dp[cost.length];
}
}