@@ -0,0 +1,513 @@
+public class Solution %7B%0A    public int uniquePaths(int m, int n) %7B%0A        if(m %3C= 0 %7C%7C n %3C= 0)%7B%0A            return 0;%0A        %7D%0A        int%5B%5D%5B%5D grid = new int%5Bm%5D%5Bn%5D;%0A        for(int i = 0; i %3C m; i ++)%7B%0A            grid%5Bi%5D%5B0%5D = 1;%0A        %7D%0A        for(int i = 0; i %3C n; i++)%7B%0A            grid%5B0%5D%5Bi%5D = 1;%0A        %7D%0A        for(int i = 1; i %3C m; i ++)%7B%0A            for(int j = 1; j %3C n; j++)%7B%0A                grid%5Bi%5D%5Bj%5D = grid%5Bi-1%5D%5Bj%5D + grid%5Bi%5D%5Bj-1%5D;%0A            %7D%0A        %7D%0A        return grid%5Bm-1%5D%5Bn-1%5D;%0A    %7D%0A%7D

Q62 Unique Paths