import java.util.Scanner;
/**
* fibonacci数列,求第n个数的值
* */
public class fibonacci {
static int[] result = new int[100];
public int getFibonacci(int n){
result[0] = 0;
result[1] = 0;
result[2] = 1;
for(int i = 3 ;i < 100; i++) {
result[i] = result[i-2] + result[i-1];
}
if(n == 1){
return 0;
}else if (n == 2){
return 1;
}else {
return result[n];
}
}
public static void main(String[] args) {
System.out.println("Please input n : ");
Scanner in = new Scanner(System.in);
int n = in.nextInt();
fibonacci f = new fibonacci();
System.out.println(f.getFibonacci(n));
}
}
fibonacci数列
最新推荐文章于 2024-08-13 20:23:27 发布