一 题目
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 7 x 3 grid. How many possible unique paths are there?
Note: m and n will be at most 100.
Example 1:
Input: m = 3, n = 2 Output: 3 Explanation: From the top-left corner, there are a total of 3 ways to reach the bottom-right corner: 1. Right -> Right -> Down 2. Right -> Down -> Right 3. Down -> Right -> Right
Example 2:
Input: m = 7, n = 3 Output: 28
二 分析
medium级别,题目要求在一个M*N的二维矩阵上,从起点到终点不同路径,每次只能走向下跟向右两种。
没做过类似的题目,又是卡住了,没有思路。看了算法珠玑的文章,才知道有多种解法。
2.1 深度优先 DFS
根据题目介绍,经过每一个格子路径数只可能源自左方或上方,所以到达目的地[i][j]的就是[i-1][j]和[i][j-1]的和。
public static void main(String[] args) {
// TODO Auto-generated method stub
int res = uniquePaths(3,2);
System.out.println(res);
res = uniquePaths(7,3);
System.out.println(res);
}
public static int uniquePaths(int m, int n) {
// f[x][y] 表示 从(0,0)到(x,y)的路径条数
int[][] f = new int[m][n];
f[0][0] = 1;
return dfs(m - 1, n - 1,f);
}
static int dfs(int x, int y, int[][] f) {
if (x < 0 || y < 0) return 0; // 数据非法,终止条件
if (x == 0 && y == 0) return f[0][0]; // 回到起点,收敛条件
if (f[x][y] > 0) {//缓存
return f[x][y];
} else {
return f[x][y] = dfs(x - 1, y,f) + dfs(x, y - 1,f);
}
}
Runtime: 0 ms, faster than 100.00% of Java online submissions for Unique Paths.
Memory Usage: 33.2 MB, less than 5.10% of Java online submissions for Unique Paths.
时间复杂度:O(M*N).
2.2 动态规划
我们用一个二维数组dp储存 到当前位置不同的走法的个数,状态转移跟上面一样,如果机器人要到(i, j)这个点,可以选择先到(i - 1, j)或者,(i, j - 1)。也就是 dp[i][j] = dp[i - 1][j] + dp[i][j - 1]。
//动态规划
public static int uniquePaths(int m, int n) {
int[][] dp = new int[m][n];
//初始化第0列
for(int i=0;i<m;i++){
dp[i][0] = 1;
}
//初始化0行
for(int i=0;i<n;i++){
dp[0][i] = 1;
}
for(int i=1;i<m;i++){
for(int j=1;j<n;j++){
dp[i][j] = dp[i-1][j]+dp[i][j-1];
}
}
return dp[m-1][n-1];
}
Runtime: 0 ms, faster than 100.00% of Java online submissions for Unique Paths.
Memory Usage: 33.1 MB, less than 5.10% of Java online submissions for Unique Paths.
时间复杂度:O(M*N).
还有使用一维数组表达的,更简洁。或者使用数学公式。感兴趣的可以看看算法珠玑:https://soulmachine.gitbooks.io/algorithm-essentials/java/dfs/unique-paths.html