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.
題意:
一個機器人要走到右下角的星星位置(如圖),但機器人只能往下或往右(一次移動一格)移動,那機器人共有多少路徑可以到達終點。
題解:
動態規劃的儲存格式如下:(每一格都代表到達此點可使用的路徑數量)
ex:
1 1 1 1
1 2 3 4
1 3 6 10
1 4 10 20
動態規劃公式如下:
此格的路徑數量 = 上面那格的路徑數量 + 左邊那格的路徑數量
result[i][j] = result[i - 1][j] + result[i][j - 1];
package LeetCode.Medium;
public class UniquePaths {
/*
動態規劃的儲存格式如下:(每一格都代表到達此點可使用的路徑數量)
ex:
1 1 1 1
1 2 3 4
1 3 6 10
1 4 10 20
動態規劃公式如下:
此格的路徑數量 = 上面那格的路徑數量 + 左邊那格的路徑數量
result[i][j] = result[i - 1][j] + result[i][j - 1];
*/
public int uniquePaths(int m, int n) {
int [][] result = new int[n][m];
//初始化第0行
for(int j = 0; j < m; j ++) {
result[0][j] = 1;
}
//初始化第0列
for(int i = 0; i < n; i ++) {
result[i][0] = 1;
}
//完成剩下的
for(int i = 1; i < n; i ++) {
for(int j = 1; j < m; j ++) {
result[i][j] = result[i - 1][j] + result[i][j - 1];
}
}
return result[n - 1][m - 1];
}
}