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.
方法1:开始时想到用递归(回溯法):
int uniquePathsBackTrack(int m, int n) {
if(m==1 || n==1) return 1;
return uniquePaths(m-1, n) + uniquePaths(m, n-1);
}
只需要着两行代码,但是超时了。然后又想用计算 排列组合的分子、分母,相除的方法,结果错误,说明Note中提示m、n最大为100是有用的,即你计算阶乘时int会溢出的。
方法2:动态规划,定义一个二维数组 A[M][N],从左上开始依次计算每一行的值,最后返回 A[M-1][N-1]即可,递推方程是:
A[I][J]=A[I-1][J]+A[I][J-1];