AcWing 822. 走方格
原题链接
困难
Java代码
动态规划思想
import java.util.*;
public class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt(), m = sc.nextInt();
System.out.println(f(n, m));
}
public static int f(int n, int m){
int[][] a = new int[n + 1][m + 1];
for(int i = 0; i <= n; i ++){
a[i][0] = 1;
}
for(int j = 0; j <= m; j ++){
a[0][j] = 1;
}
for(int i = 1; i <= n; i ++){
for(int j = 1; j <= m; j ++){
if(i > 0 && j > 0){
a[i][j] = a[i - 1][j] + a[i][j - 1];
}
}
}
return a[n][m];
}
}