Unique Paths by LeetCode
java编写
public class Unique_Paths {
static int count;
static int x=0;
static int y=0;
public static void main(String[] args) {
System.out.println(uniquePaths(7, 3));
}
public static int uniquePaths(int m, int n) {
dfs1(x,y,n,m);
return count;
}
public static void dfs1(int x,int y,int n,int m) {
if(x==-1||xn||y-1||ym) {
return;
}
if(xn-1&&y==m-1) {
count++;
return;
}
dfs1( x+1, y,n,m);
dfs1( x, y+1,n,m);
}
}
自己写出来的答案是对的,但就是时间超时了,用了回溯的方法,竟然还会超时,我以为这个方法应该是最快的了,很难受。以下是没有超时的答案。
public int uniquePaths(int m, int n) {
if (m == 0 || n == 0) {
return 0;
}
if (m > n) {
int t = m;
m = n;
n = t;
}
int[] res = new int[m];
Arrays.fill(res, 1);
for (int i = 1; i < n; i++) {
for (int j = 1; j < m; j++) {
res[j] += res[j - 1];
}
}
return res[m - 1];
}