package fabonacci;
public class Fibonacci {
public int fibonacciRecursive(int n) {
if (n <= 1)
return 1;
return fibonacciRecursive(n - 1) + fibonacciRecursive(n - 2);
}
public int finonacciNormal(int n) {
if (n<=1)
return 1;
int a1 = 1, a2 = 1;
int an =0;;
for (int i = 1; i < n; i++) {
an = a1 + a2;
a1 = a2;
a2 = an;
}
return an;
}
public static void main(String[] args) {
Fibonacci fibonacci = new Fibonacci();
System.out.println("fibonacciRecursive===" + fibonacci.fibonacciRecursive(11));
System.out.println("finonacciNormal===" + fibonacci.finonacciNormal(11));
}
}
费波那契 递归 非递归 算法 java实现
最新推荐文章于 2024-06-21 16:38:17 发布