classSolution { intmax=0; publicintuniquePaths(int m, int n) { find(m, n, 0, 0); return max; }
publicvoidfind(int m, int n, int x, int y) { if(x >= m || y >= n) { return; } if(x == m - 1 && y == n - 1) { max++; } find(m, n, x + 1, y); find(m, n, x, y + 1); } }