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
思路:dp问题,dp[i][j]表示到达第i行第j列的方法数,由于机器人只有向下和向右两种行走方式,所以第i行第j列等于这一格的上边一格和左边一格之和。即dp[i][j]=dp[i-1][j]+dp[i][j-1];
初始化dp时,第一行每一格都只有一种方法,第一列每一格也只有一种方法。
package com.Ryan;
public class UniquePaths {
public static void main(String[] args) {
UniquePaths uniquePaths=new UniquePaths();
int m=7,n=3;
System.out.println(uniquePaths.uniquePaths(m, n));
}
public int uniquePaths(int m, int n) {
int dp[][]=new int[m+1][n+1];
dp[1][1]=1;
for (int i = 1; i <= n; i++) {
dp[1][i]=1;
}
for (int j = 1; j <= m; j++) {
dp[j][1]=1;
}
for (int i = 2; i <=m; i++) {
for (int j = 2; j <= n; j++) {
dp[i][j]=dp[i-1][j]+dp[i][j-1];
}
}
return dp[m][n];
}
}