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.
/* z我最开始只想用递归,后来不行,我就用下图的记忆化存储的递归方法,把子问题存储起来,省的重复计算,结果还是说我时间复杂度太大
* int[][] arr = new int[m+1][n+1];
if(arr[m][n] != 0) {
return arr[m][n];
}
if( 1 == m) {
arr[m][n] = 1;
}else if( 1 == n){
arr[m][n] = 1;
}else {
arr[m][n] = uniquePaths(m - 1, n ) + uniquePaths(m , n - 1 );
}
return arr[m][n];*/
//后来想想,用自底向上的最优化子结构应该会比自顶向下要简单一些,如图所示,通过,并且和牛客网上的最优解法几乎一致
int[][] arr = new int[m+1][n+1];
for(int i = 0 ; i <= m ; i ++) {
arr[i][1] = 1;
}
for(int j = 0 ; j <= n ; j ++) {
arr[1][j] = 1;
}
for(int i = 2 ; i <= m ; i ++) {
for(int j = 2 ;j <= n ; j ++) {
arr[i][j] = arr[i-1][j]+arr[i][j-1];
}
}
return arr[m][n];