@@ -0,0 +1,468 @@
+package leetcode.unique_paths;%0A%0Apublic class Solution %7B%0A%09public static int C(int n, int m)%7B%0A%09%09if(n - m %3C m) m = n - m;%0A%09%09long ans = 1;%0A%09%09for(int i = 1; i %3C= m; i++)%7B%0A%09%09%09ans *= n + 1 - i;%0A%09%09%09ans /= i;%0A%09%09%7D%0A%09%09return (int)ans;%0A%09%7D%0A%09%0A    public int uniquePaths(int m, int n) %7B%0A    %09if(m == 0 %7C%7C n == 0) return 1;%0A    %09return C(m + n - 2, n - 1);%0A    %7D%0A    %0A    public static void main(String%5B%5D args)%7B%0A    %09System.err.println(new Solution().uniquePaths(51, 9) + %22%22);%0A    %7D%0A%7D%0A

Add java solution for 62. Unique Paths