2024/9/26 Hot100 多维dp
This commit is contained in:
parent
2fe32a5218
commit
615730e9b9
|
@ -0,0 +1,33 @@
|
|||
package com.cool.hot100.multi_dp;
|
||||
|
||||
/**
|
||||
* Created with IntelliJ IDEA.
|
||||
*
|
||||
* @Author: Cool
|
||||
* @Date: 2024/09/26/17:16
|
||||
* DayNumber 4
|
||||
* Hard 2
|
||||
* Level ?
|
||||
* @Description 62. 不同路径
|
||||
* @Link https://leetcode.cn/problems/unique-paths/description/?envType=study-plan-v2&envId=top-100-liked
|
||||
*/
|
||||
public class Num62 {
|
||||
|
||||
|
||||
public int uniquePaths(int m, int n) {
|
||||
int[][] dp = new int[m][n];
|
||||
for (int i = 0; i < n; i++) {
|
||||
dp[0][i] = 1;
|
||||
}
|
||||
for (int i = 0; i < m; i++) {
|
||||
dp[i][0] = 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];
|
||||
}
|
||||
|
||||
}
|
Loading…
Reference in New Issue