62. 不同路径
- 学习文章链接:
- 思路:重要的是理解在棋盘格中,因为终点只在右下角,因此到达终点的路径只来自两个方向,即上和左,因此推出dp数组递推公式。
- 代码:
class Solution {
public int uniquePaths(int m, int n) {
int[][] dp = new int[m][n];
for (int i = 0; i < m; i++) dp[i][0] = 1;
for (int j = 0; j < n; j++) dp[0][j] = 1;
for (int i = 1; i < m; i++) {
for (int j = 1; j < n; j++) {
dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
}
}
return dp[m - 1][n - 1];
}
}
63. 不同路径 II
- 学习文章链接:
- 思路:在62.不同路径的基础上增加了障碍物的判定条件。详情见注释。
- 代码:
class Solution {
public int uniquePathsWithObstacles(int[][] obstacleGrid) {
int m = obstacleGrid.length;
int n = obstacleGrid[0].length;
if (obstacleGrid[0][0] == 1 || obstacleGrid[m - 1][n - 1] == 1) return 0;
int[][] dp = new int [m][n];
for (int i = 0; i < m && obstacleGrid[i][0] != 1; i++) dp[i][0] = 1;
for (int j = 0; j < n && obstacleGrid[0][j] != 1; j++) dp[0][j] = 1;
for (int i = 1; i < m; i++) {
for (int j = 1; j < n; j++) {
if (obstacleGrid[i][j] == 1) continue;
dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
}
}
return dp[m - 1][n - 1];
}
}
343. 整数拆分
- 学习文章链接:
- 思路:这题难理解的地方就在于拆分两次及两次以上的计算方法。具体见注释,更详尽的请移步代码随想录!!!
- 代码:
class Solution {
public int integerBreak(int n) {
int[] dp = new int[n + 1];
dp[2] = 1;
for (int i = 3; i <= n; i++) {
for (int j = 1; j <= i / 2;j ++ ){
dp[i] = Math.max(dp[i], Math.max(dp[i - j] * j, j * (i - j)));
}
}
return dp[n];
}
}