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:
- Right -> Right -> Down
- Right -> Down -> Right
- Down -> Right -> Right
Example 2:
Input: m = 7, n = 3
Output: 28
tag : array, dynamic programming
很显然就使用dp,因为下一步的解决方案显然等于经过right的上一步的解决方案+经过down的上一步解决方案
dp[i][j] = dp[i-1][j] + dp[i][j-1]
method 1
public int uniquePaths(int m, int n) {
int[][] dp = new int[m][n];
dp[0][0] = 1;
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
if (i != 0)
dp[i][j] += dp[i-1][j];
if (j != 0)
dp[i][j] += dp[i][j-1];
}
}
return dp[m-1][n-1];
}