方法一:递归 public int uniquePaths (int m, int n) { // write code here int sum = 0; sum = search(1,1,m,n); return sum; } public int search(int row,int col,int m,int n){ if (row == m && col == n) return 1; if (row == m) return search(row,col+1,m,n); if (col == n) return search(row+1,col,m,n); ret...