题解 | #走方格的方案数#
走方格的方案数
https://www.nowcoder.com/practice/e2a22f0305eb4f2f9846e7d644dba09b
import java.util.*; // 注意类名必须为 Main, 不要有任何 package xxx 信息 public class Main { public static void main(String[] args) { Scanner input = new Scanner(System.in); int n = input.nextInt(); int m = input.nextInt(); int[][] arr = new int[n + 1][m + 1]; for (int i = 1; i < n + 1; i++) { for (int j = 1; j < m + 1; j++) { if (i == 1) { arr[i][j] = j + 1; } else if (j == 1) { arr[i][j] = i + 1; } else { arr[i][j] = arr[i - 1][j] + arr[i][j - 1]; } } } // for (int[] ints : arr) { // System.out.println(Arrays.toString(ints)); // } System.out.println(arr[n][m]); } }