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).
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.
分析:
这道题本来可以用组合数公式计算,但是提交有错误,所以还是用动态规划,是动态规划典型的一道题,可以用二维字典也可以用一维字典。
public class Solution {
public int uniquePaths(int m, int n) {
int[] dp = new int[n];
dp[0] = 1;
for(int i=0; i<m; i++)
for(int j=1; j<n; j++)
dp[j] += dp[j-1];
return dp[n-1];
}
}