@@ -0,0 +1,777 @@
+/**%0A * A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).%0A * 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).%0A * How many possible unique paths are there?%0A **/%0Apublic class Solution %7B%0A    public int uniquePaths(int m, int n) %7B%0A        if(m==0 %7C%7C n==0)    return 0;%0A        %0A        int%5B%5D%5B%5D paths = new int%5Bm%5D%5Bn%5D;%0A        for(int i=m-1; i%3E=0; i--)%0A            paths%5Bi%5D%5Bn-1%5D=1;%0A        for(int j=n-1; j%3E=0; j--)%0A            paths%5Bm-1%5D%5Bj%5D=1;%0A        for(int i=m-2; i%3E=0; i--)%0A            for(int j=n-2; j%3E=0; j--)%0A                paths%5Bi%5D%5Bj%5D = paths%5Bi+1%5D%5Bj%5D + paths%5Bi%5D%5Bj+1%5D;%0A        return paths%5B0%5D%5B0%5D;%0A    %7D%0A%7D%0A

Create 062.java