[Leetcode] 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?
Above is a 3 x 7 grid. How many possible unique paths are there?
Note: m and n will be at most 100.
Solution:
1 public class Solution { 2 public int uniquePaths(int m, int n) { 3 int[][] dp=new int[m][n]; 4 for(int i=0;i<n;++i){ 5 dp[0][i]=1; 6 } 7 for(int i=0;i<m;++i){ 8 dp[i][0]=1; 9 } 10 for(int i=1;i<m;++i){ 11 for(int j=1;j<n;++j){ 12 dp[i][j]=dp[i-1][j]+dp[i][j-1]; 13 } 14 } 15 return dp[m-1][n-1]; 16 } 17 }