标签:col cat span assets example down most robot grid
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
1 class Solution { 2 public int uniquePaths(int m, int n) { 3 int [][]dp = new int[m][n]; 4 dp[0][0] = 1; 5 for (int i = 0; i < m; ++i) { 6 for (int j = 0; j < n; ++j) { 7 if (j - 1 >= 0) dp[i][j] += dp[i][j - 1]; 8 if (i - 1 >= 0) dp[i][j] += dp[i - 1][j]; 9 } 10 } 11 return dp[m - 1][n - 1]; 12 } 13 }
标签:col cat span assets example down most robot grid
原文地址:https://www.cnblogs.com/hyxsolitude/p/12324065.html