题解 | 斐波那契数列
斐波那契数列
https://www.nowcoder.com/practice/ee5d403c1172487f8c7915b3c3d924c6
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int b = in.nextInt();
System.out.println(run(b));
}
public static int run(int nmb){
if(nmb == 1 || nmb == 2){
return 1;
}
// 初始化
int[] dp = new int[nmb];
// 初始化dp，根据题目 1 2 为 1
dp[0]=1;
dp[1]=1;
// 遍历
for(int i = 2; i < nmb; i++){
dp[i] = dp[i-1] + dp[i-2];
}
return dp[nmb-1];
}
}
查看19道真题和解析