class Solution {
// 先初始化第一行,在初始化第一列
public int uniquePaths(int m, int n) {
int[][] dp = new int[n][m];
for (int i = 0; i < n; i++) {
dp[i][0] = 1;
}
for (int i = 0; i < m; i++) {
dp[0][i] = 1;
}
for (int i = 1; i < n; i++) {
for (int j = 1; j < m; j++) {
dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
}
}
return dp[n - 1][m - 1];
}
}
空间优化
class Solution {
public int uniquePaths(int m, int n) {
int[] dp = new int[m];
Arrays.fill(dp, 1);
for (int i = 1; i < n; i++) {
for (int j = 1; j < m; j++) {
dp[j] += dp[j - 1];
}
}
return dp[m - 1];
}
}