@@ -0,0 +1,805 @@
+package leetcode;%0A%0Aimport java.util.HashMap;%0Aimport java.util.Map;%0A%0A/**%0A * https://leetcode.com/problems/unique-paths/%0A */%0Apublic class Problem62 %7B%0A    public int uniquePaths(int m, int n) %7B%0A        Map%3CString, Integer%3E memo = new HashMap%3C%3E();%0A        return uniquePaths(m, n, 1, 1, memo);%0A    %7D%0A    %0A    private int uniquePaths(int m, int n, int x, int y, Map%3CString, Integer%3E memo) %7B%0A        if (x %3E m %7C%7C y %3E n) %7B%0A            return 0;%0A        %7D%0A        if (x == m && y == n) %7B%0A            return 1;%0A        %7D%0A        if (memo.containsKey(x + %22%7C%22 + y)) %7B%0A            return memo.get(x + %22%7C%22 + y);%0A        %7D%0A        int a = uniquePaths(m, n, x+1, y, memo);%0A        int b = uniquePaths(m, n, x, y+1, memo);%0A        int result = a + b;%0A        memo.put(x + %22%7C%22 + y, result);%0A        return result;%0A    %7D%0A%7D%0A

Solve problem 62