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

爬楼梯 - 题解

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n=sc.nextInt();  //次数为n
        int[] m=new int[n];

        for (int i = 0; i < n; i++) {
            m[i]=sc.nextInt()-1;
        }
        int[][] dp=new int [n][45];

        for (int i = 0; i < n; i++) {
            dp[i][0]=1;
            dp[i][1]=1;
            dp[i][2]=2;
        }


        for (int i = 0; i < n; i++) { //次数
            for (int j = 2; j <= m[i]; j++) {  //
                dp[i][j]=dp[i][j-1]+dp[i][j-2];
            }
        }

        for (int i = 0; i < n; i++) {
            System.out.println(dp[i][m[i]]);
        }
    }
}
0 回复 0 转发 0 喜欢 1 阅读
回复 (0)
默认 最新
暂无回复,快来抢沙发!