public static int fibStart(int i){
int a = 1;
int b = 1;
int c = 0;
if (i == 1 || i == 2){
return 1;
}else {
//i是项数,因为第一项和第二项已经用掉了,所以i-2将用掉的两项去掉
for (int j = 0; j < i - 2 ; j++) {
c = a + b;
a = b;
b = c;
}
return c;
}
}
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
while (scan.hasNextInt()){
int a = scan.nextInt();
System.out.println(fibStart(a));
}
}
求斐波那契数列的第n项。(迭代实现)
最新推荐文章于 2024-07-14 14:59:27 发布