class Solution {
public:
int uniquePaths(int m, int n) {
if(m == 1 || n == 1) return 1;
vector<vector<int>>arr(m, vector<int>(n, 0));
for (int i = 0; i < m; i++) {
arr[i][0] = 1;
}
for (int i = 0; i < n; i++) {
arr[0][i] = 1;
}
for (int i = 1; i < m; i++) {
for (int j = 1; j < n; j++) {
arr[i][j] = arr[i - 1][j] + arr[i][j - 1];
}
}
return arr[m - 1][n - 1];
}
};
62-不同路径(机器人从矩阵的左上角走到右下角的路径)
最新推荐文章于 2023-08-30 07:30:00 发布