62. Unique Paths
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?
题目大意:一个机器从从网格的左上走到右下一共有多少唯一路径
思路:动态规划
代码:
class Solution { public int uniquePaths(int m, int n) { if (m == 0 && n == 0) { return 0; } int[][] dp = new int[m][n]; for(int i=0;i<m;i++) { for(int j=0;j<n;j++) { if (i == 0 || j == 0) { dp[i][j] = 1; } else { dp[i][j] = dp[i][j - 1] + dp[i - 1][j]; } } } return dp[m - 1][n - 1]; } }