unique-paths

Author: chjung99

unique-paths/chjung99.java

@@ -0,0 +1,18 @@
+class Solution {
+
+    public int uniquePaths(int m, int n) {
+        int[][] dp = new int[m+1][n+1]; // (1,1) ~ (m, n)
+
+        for (int i = 1; i <= n; i++){
+            dp[1][i] = 1;
+        }
+        for (int i = 2; i <= m; i++){
+            for (int j = 1; j <= n; j++){
+                dp[i][j] = dp[i][j-1] + dp[i-1][j];
+            }
+        }
+        return dp[m][n];
+    }
+}
+
+