题目
Description
斐波纳契数列
1,1,2,3,5,8,13,21,34,55,89……这个数列则称为“斐波纳契数列”,其中每个数字都是“斐波纳契数”。
Input
一个整数N(N不能大于40)
Output
由N个“斐波纳契数”组成的“斐波纳契数列”。
Sample Input
6
Sample Output
1 1 2 3 5 8
代码块
import java.math.BigInteger;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner cin = new Scanner(System.in);
int n = cin.nextInt();
for (int i = 1; i <= n; i++)
System.out.print(fibonacciNormal(i) + " ");
System.out.println();
cin.close();
}
public static BigInteger fibonacciNormal(int n) {
if (n == 1) {
return new BigInteger("1");
}
BigInteger n1 = new BigInteger("0"), n2 = new BigInteger("1"), sn = new BigInteger(
"0");
for (int i = 0; i < n - 1; i++) {
sn = n1.add(n2);
n1 = n2;
n2 = sn;
}
return sn;
}
}