前两个数的和为第三个数值
//方法一:
public class Solution {
public static void main(String[] args) {
int fibonacci = Fibonacci(y);
System.out.println(fibonacci);
}
public static int Fibonacci(int m) {
int x = 0;
int[] pArr = new int[40];
pArr[0] = 0;
pArr[1] = 1;
if (m<2){
if (m==0){
return 0;
}else {
return 1;
}
}else {
for (int n = 2; n <= m; n++) {
pArr[n] = pArr[n - 1] + pArr[n - 2];
x = pArr[n];
}
return x;
}
}
}
方法二:
public static void main(String[] args) {
int x = Fibonacci2(4);
System.out.println(x);
}
public static int Fibonacci2(int n) {
if (n <= 2) {
if (n == 0) {
return 0;
} else {
return 1;
}
} else {
return Fibonacci2(n - 1) + Fibonacci2(n - 2);
}
}