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 3 x 7 grid. How many possible unique paths are there?
Java:
public class Solution {
public int uniquePaths(int m, int n) {
if(m<=1 || n <= 1) return 1;
int[][] destination = new int[m][n];
destination[0][0] = 1;
for(int i=1; i<m;i++)
{
destination[i][0] = 1;
}
for(int j=1; j<n; j++)
{
destination[0][j] = 1;
}
for(int i=1;i<m;i++)
{
for(int j=1; j<n; j++)
{
destination[i][j] = destination[i-1][j] + destination[i][j-1];
}
}
return destination[m-1][n-1];
}
}