题目:
我的解法一:递归(超时了)
class Solution {
int path_num = 1;
public int uniquePaths(int m, int n) {
goOneStep(0, 0, m, n);
return path_num;
}
public void goOneStep(int x, int y, int m, int n){
if(x+1<m && y+1<n){
path_num++;
goOneStep(x+1, y, m, n);
goOneStep(x, y+1, m, n);
}
return;
}
}
我的解法二:动态规划
class Solution {
public int uniquePaths(int m, int n) {
int[][] paths = new int[m][n];
for(int i=0; i<m; i++){
paths[i][0] = 1;
}
for(int j=0; j<n; j++){
paths[0][j] = 1;
}
for(int i=1; i<m; i++){
for(int j=1; j<n; j++){
paths[i][j] = paths[i-1][j] + paths[i][j-1];
}
}
return paths[m-1][n-1];
}
}
官方题解: