- 题目
A robot is located at the top-left corner of a m x n grid (marked ‘Start’ in the diagram below).
The robot can only move either down or right at any point in time. The robot is trying to reach the bottom-right corner of the grid (marked ‘Finish’ in the diagram below).
How many possible unique paths are there?
Above is a 3 x 7 grid. How many possible unique paths are there?
Note: m and n will be at most 100.
- 解析
状态F(i,j):从左上角到达(i,j)的路径的总数量
返回最后到达右下角的总路径数F(row-1,cow-1)
状态递归:F(i,j) = F(i-1,j)+F(i,j-1)
初始状态:F(0,0) = 1:从左上角到(0,0)只有一种方法。
分析题目,表格边上的路径也只有一种方法到达:F(0,j) = 1,F(i,0) = 1;
代码:
public class Solution {
public int uniquePaths(int m, int n) {
if(m<1||n<1){
return 0;
}
int[][] path = new int[m][n];
//初始化
path[0][0] = 1;
for(int i = 0; i < m; i++){
path[i][0] = 1;
}
for(int j = 0; j < n; j++){
path[0][j] = 1;
}
for(int i = 1;i<m;i++){
for(int j = 1;j<n;j++){
path[i][j] = path[i-1][j]+path[i][j-1];
}
}
return path[m-1][n-1];
}
}