返回题解分享
讨论 / 题解分享/ 帖子详情

走方格(编程题) - 题解

import java.util.*;
public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int m = sc.nextInt();
		int [][]dp = new int[n][m];
		for(int i = 0; i < n; i++) {
			dp[i][0] = 1;
		}
		for(int i = 0; i < m; i++) {
			dp[0][i] = 1;
		}
		
		for(int i = 1; i < n; i++) {
			for(int j = 1; j < m; j++) {
				if((i+1) % 2 != 0 || (j+1) % 2 != 0) {
					dp[i][j] = dp[i][j-1] + dp[i-1][j];
				}
			}
		}
		System.out.println(dp[n-1][m-1]);
	}
}
0 回复 0 转发 0 喜欢 0 阅读
回复 (0)
默认 最新
暂无回复,快来抢沙发!