斐波那契数列(前两项之和构成后一项)
1.数组方式实现
代码:
public class test {
//数组实现
public static void main(String[] args) {
int[] arr = new int[8];
arr[0] = 1;
arr[1] = 1;
System.out.println(arr[0]);
System.out.println(arr[1]);
for(int i=2;i<arr.length;i++) {
arr[i]=arr[i-1]+arr[i-2];
System.out.println(arr[i]);
}
}
}
2.递归实现
/**
* 1 1 2 3 5 8 13 21
*
* 1 = fun(1)
* 1 = fun(2)
* 2 = fun(1) + fun(2)
* 3 = fun(2) + fun(3)
* @return
* /
代码:
//递归实现
public static int fun(int i) {
if(i < 2) {
return i == 0?0:1;
}else {
return fun(i-1) + fun(i-2);
}
}