题解 | #走方格的方案数#

import java.util.*; 
import java.io.*;

// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
    public static void main(String[] args) {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
            try {
                String s = br.readLine();
                String[] s1 = s.split(" ");
                int m = Integer.valueOf(s1[0]);//横向格子数
                int n = Integer.valueOf(s1[1]);//纵向格子数
                int[][] dp = new int[m+2][n+2];
                for (int i = 1; i <=m+1 ; i++) {
                    for (int j = 1; j <=n+1 ; j++) {
                        if(i==1 || j==1){
                            dp[i][j]=1;
                        }else{
                            dp[i][j]=dp[i-1][j]+dp[i][j-1];
                        }
                    }
                }
                System.out.println(dp[m+1][n+1]);
            } catch (IOException e) {
                e.printStackTrace();
            }
    }
}