add 62. Unique Paths

Author: miladra

java/62-Unique-Paths.java

@@ -0,0 +1,22 @@
+class Solution {
+    public static int uniquePaths(int m, int n) {
+           int[][] dp = new int[m][n];
+   
+           // Fill out last row
+           for (int j = 0; j < n; j++) {
+               dp[m-1][j] = 1;
+           }
+   
+           // Fill out last column
+           for (int i = 0; i < m; i++) {
+               dp[i][n-1] = 1;
+           }
+   
+           for (int i = m - 2; i >= 0; i--) {
+               for (int j = n - 2; j >= 0; j--) {
+                   dp[i][j] = dp[i][j + 1] + dp[i + 1][j];
+               }
+           }
+           return dp[0][0];
+       }
+   }