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?
解题:
原始思路:使用数学计算的方法,排列组合算。
得使用BigInteger 写代码过程中犯了错误,int->String a+”0” 应该是a+””即可
改进思路:动态规划
方法一:二维数组
public int uniquePaths(int m,intn ){
int[][]a =new int[m][n];
for (int i = 0;i <m;i++) {
a[i][0] = 1;
}
for (int i = 0;i <n;i++) {
a[0][i] = 1;
}
for (int i = 1;i <m;i++) {
for (int j = 1;j <n;j++) {
a[i][j] =a[i-1][j] +a[i][j-1];
}
}
return a[m-1][n-1];
}
方法二:一维数组
public int uniquePaths(int m,int n) {
// DP with 1 dimension array
int[]a =new int[n];
for (int j = 0;j <n;j++) {
a[j] = 1;
}
for (int i = 1;i <m;i++) {
for (int j = 1;j <n;j++) {
a[j] +=a[j-1];
}
}
return a[n-1];
}